./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.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 72cd0a4215707a62376e213156123902caf611a87605e41064b672632b6ef1f9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:24:27,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:24:27,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:24:27,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:24:27,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:24:27,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:24:27,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:24:27,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:24:27,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:24:27,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:24:27,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:24:27,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:24:27,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:24:27,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:24:27,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:24:27,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:24:27,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:24:27,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:24:27,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:24:27,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:24:27,350 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:24:27,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:24:27,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:24:27,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:24:27,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:24:27,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:24:27,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:24:27,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:24:27,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:24:27,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:24:27,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:24:27,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:24:27,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:24:27,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:24:27,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:24:27,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:24:27,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:24:27,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:24:27,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:24:27,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:24:27,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:24:27,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:24:27,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 04:24:27,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:24:27,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:24:27,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:24:27,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:24:27,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:24:27,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:24:27,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:24:27,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:24:27,406 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:24:27,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:24:27,407 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:24:27,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 04:24:27,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:24:27,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:24:27,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:24:27,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:24:27,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:24:27,409 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:24:27,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:24:27,410 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:24:27,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:24:27,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:24:27,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:24:27,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:24:27,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:24:27,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:24:27,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:24:27,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:24:27,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 04:24:27,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 04:24:27,412 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:24:27,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:24:27,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:24:27,413 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 -> 72cd0a4215707a62376e213156123902caf611a87605e41064b672632b6ef1f9 [2022-07-12 04:24:27,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:24:27,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:24:27,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:24:27,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:24:27,668 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:24:27,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2022-07-12 04:24:27,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2535d884/dab1fa241fa34ea58f5a9ee08970a1a6/FLAG1cdcb44f2 [2022-07-12 04:24:28,144 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:24:28,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2022-07-12 04:24:28,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2535d884/dab1fa241fa34ea58f5a9ee08970a1a6/FLAG1cdcb44f2 [2022-07-12 04:24:28,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2535d884/dab1fa241fa34ea58f5a9ee08970a1a6 [2022-07-12 04:24:28,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:24:28,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:24:28,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:24:28,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:24:28,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:24:28,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e346619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28, skipping insertion in model container [2022-07-12 04:24:28,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:24:28,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:24:28,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c[597,610] [2022-07-12 04:24:28,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:24:28,739 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:24:28,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c[597,610] [2022-07-12 04:24:28,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:24:28,766 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:24:28,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28 WrapperNode [2022-07-12 04:24:28,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:24:28,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:24:28,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:24:28,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:24:28,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,794 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-07-12 04:24:28,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:24:28,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:24:28,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:24:28,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:24:28,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:24:28,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:24:28,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:24:28,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:24:28,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (1/1) ... [2022-07-12 04:24:28,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:24:28,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:28,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 04:24:28,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 04:24:28,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:24:28,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 04:24:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 04:24:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 04:24:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:24:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:24:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 04:24:28,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 04:24:28,970 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:24:28,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:24:29,083 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:24:29,088 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:24:29,088 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 04:24:29,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:24:29 BoogieIcfgContainer [2022-07-12 04:24:29,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:24:29,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:24:29,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:24:29,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:24:29,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:24:28" (1/3) ... [2022-07-12 04:24:29,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6832b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:24:29, skipping insertion in model container [2022-07-12 04:24:29,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:24:28" (2/3) ... [2022-07-12 04:24:29,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad6832b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:24:29, skipping insertion in model container [2022-07-12 04:24:29,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:24:29" (3/3) ... [2022-07-12 04:24:29,098 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound2.c [2022-07-12 04:24:29,111 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:24:29,111 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:24:29,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:24:29,157 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@677236a2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@718bb1eb [2022-07-12 04:24:29,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:24:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 04:24:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 04:24:29,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:29,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:29,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:29,174 INFO L85 PathProgramCache]: Analyzing trace with hash 689891435, now seen corresponding path program 1 times [2022-07-12 04:24:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:29,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003594002] [2022-07-12 04:24:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:29,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 04:24:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:29,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 04:24:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:24:29,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:24:29,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003594002] [2022-07-12 04:24:29,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003594002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:24:29,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:24:29,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 04:24:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470168783] [2022-07-12 04:24:29,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:24:29,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 04:24:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:24:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 04:24:29,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:24:29,342 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:24:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:29,356 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-07-12 04:24:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 04:24:29,358 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-07-12 04:24:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:29,365 INFO L225 Difference]: With dead ends: 51 [2022-07-12 04:24:29,366 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 04:24:29,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:24:29,373 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:29,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:24:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 04:24:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 04:24:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:24:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-12 04:24:29,405 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2022-07-12 04:24:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:29,405 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-12 04:24:29,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:24:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-12 04:24:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 04:24:29,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:29,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:29,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 04:24:29,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 90086127, now seen corresponding path program 1 times [2022-07-12 04:24:29,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:29,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971325980] [2022-07-12 04:24:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:29,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:29,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:29,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869848909] [2022-07-12 04:24:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:29,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:29,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:29,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:29,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 04:24:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:29,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 04:24:29,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:24:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:24:29,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:24:29,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:24:29,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971325980] [2022-07-12 04:24:29,723 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:24:29,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869848909] [2022-07-12 04:24:29,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869848909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:24:29,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:24:29,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 04:24:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302911597] [2022-07-12 04:24:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:24:29,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 04:24:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:24:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 04:24:29,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 04:24:29,732 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:24:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:29,867 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-07-12 04:24:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 04:24:29,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-07-12 04:24:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:29,870 INFO L225 Difference]: With dead ends: 35 [2022-07-12 04:24:29,870 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 04:24:29,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 04:24:29,872 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:29,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 71 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:24:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 04:24:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-07-12 04:24:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 04:24:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-12 04:24:29,886 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2022-07-12 04:24:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:29,888 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-12 04:24:29,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:24:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-12 04:24:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 04:24:29,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:29,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:29,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 04:24:30,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:30,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1522625704, now seen corresponding path program 1 times [2022-07-12 04:24:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:30,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030169294] [2022-07-12 04:24:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:30,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:30,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998169731] [2022-07-12 04:24:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:30,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:30,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:30,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:30,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 04:24:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:30,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 04:24:30,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:24:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:24:30,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:24:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:24:30,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030169294] [2022-07-12 04:24:30,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:24:30,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998169731] [2022-07-12 04:24:30,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998169731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:24:30,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-12 04:24:30,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-07-12 04:24:30,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326406212] [2022-07-12 04:24:30,710 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-12 04:24:30,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 04:24:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:24:30,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 04:24:30,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-12 04:24:30,714 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:24:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:30,876 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-12 04:24:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 04:24:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-07-12 04:24:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:30,878 INFO L225 Difference]: With dead ends: 57 [2022-07-12 04:24:30,878 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 04:24:30,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 04:24:30,879 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:30,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:24:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 04:24:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 04:24:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 04:24:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-07-12 04:24:30,886 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2022-07-12 04:24:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:30,886 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-07-12 04:24:30,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:24:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-07-12 04:24:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 04:24:30,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:30,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:30,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 04:24:31,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 04:24:31,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 252381658, now seen corresponding path program 1 times [2022-07-12 04:24:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:31,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746106397] [2022-07-12 04:24:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:31,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:31,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:31,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527934943] [2022-07-12 04:24:31,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:31,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:31,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:31,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:31,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 04:24:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:31,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 04:24:31,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:24:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:24:31,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:24:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:24:31,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:24:31,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746106397] [2022-07-12 04:24:31,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:24:31,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527934943] [2022-07-12 04:24:31,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527934943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:24:31,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:24:31,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-07-12 04:24:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589858092] [2022-07-12 04:24:31,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:24:31,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 04:24:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:24:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 04:24:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 04:24:31,488 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 04:24:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:31,817 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-07-12 04:24:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 04:24:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-12 04:24:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:31,818 INFO L225 Difference]: With dead ends: 44 [2022-07-12 04:24:31,819 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 04:24:31,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-07-12 04:24:31,820 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:31,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 04:24:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 04:24:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-07-12 04:24:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 04:24:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-07-12 04:24:31,829 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2022-07-12 04:24:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:31,829 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-07-12 04:24:31,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 04:24:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-07-12 04:24:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 04:24:31,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:31,831 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-12 04:24:31,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 04:24:32,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:32,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1035193378, now seen corresponding path program 1 times [2022-07-12 04:24:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:32,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594076650] [2022-07-12 04:24:32,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:32,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316800272] [2022-07-12 04:24:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:32,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:32,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:32,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 04:24:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:32,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 04:24:32,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:24:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 04:24:32,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:24:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 04:24:32,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:24:32,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594076650] [2022-07-12 04:24:32,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:24:32,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316800272] [2022-07-12 04:24:32,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316800272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:24:32,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:24:32,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-07-12 04:24:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147240037] [2022-07-12 04:24:32,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:24:32,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 04:24:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:24:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 04:24:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-12 04:24:32,667 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 22 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 04:24:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:33,306 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-07-12 04:24:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 04:24:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2022-07-12 04:24:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:33,307 INFO L225 Difference]: With dead ends: 52 [2022-07-12 04:24:33,308 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 04:24:33,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 04:24:33,309 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:33,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 234 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2022-07-12 04:24:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 04:24:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-07-12 04:24:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 04:24:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-07-12 04:24:33,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 35 [2022-07-12 04:24:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:33,318 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-07-12 04:24:33,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 04:24:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-07-12 04:24:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 04:24:33,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:33,320 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:33,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 04:24:33,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:33,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1258851889, now seen corresponding path program 1 times [2022-07-12 04:24:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:33,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629401187] [2022-07-12 04:24:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:33,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:33,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062904626] [2022-07-12 04:24:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:33,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:33,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:33,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:33,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 04:24:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:24:33,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 04:24:33,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:24:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 04:24:33,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:24:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 04:24:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:24:33,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629401187] [2022-07-12 04:24:33,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:24:33,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062904626] [2022-07-12 04:24:33,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062904626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:24:33,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:24:33,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-12 04:24:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830198113] [2022-07-12 04:24:33,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:24:33,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 04:24:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:24:33,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 04:24:33,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 04:24:33,876 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-12 04:24:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:34,011 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-07-12 04:24:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 04:24:34,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 44 [2022-07-12 04:24:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:34,012 INFO L225 Difference]: With dead ends: 55 [2022-07-12 04:24:34,013 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 04:24:34,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-07-12 04:24:34,014 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:34,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:24:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 04:24:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-07-12 04:24:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 04:24:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-07-12 04:24:34,024 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 44 [2022-07-12 04:24:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:34,024 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-07-12 04:24:34,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-12 04:24:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-07-12 04:24:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 04:24:34,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:34,026 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:34,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 04:24:34,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:34,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash 614391490, now seen corresponding path program 2 times [2022-07-12 04:24:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:34,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380837543] [2022-07-12 04:24:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:34,251 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:34,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852476767] [2022-07-12 04:24:34,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:24:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:34,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:34,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:34,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 04:24:34,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:24:34,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:24:34,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 04:24:34,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:24:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 04:24:34,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:24:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 04:24:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:24:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380837543] [2022-07-12 04:24:34,424 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:24:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852476767] [2022-07-12 04:24:34,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852476767] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:24:34,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:24:34,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-07-12 04:24:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814761088] [2022-07-12 04:24:34,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:24:34,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 04:24:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:24:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 04:24:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 04:24:34,427 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 04:24:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:24:34,531 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-07-12 04:24:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 04:24:34,531 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), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 53 [2022-07-12 04:24:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:24:34,532 INFO L225 Difference]: With dead ends: 77 [2022-07-12 04:24:34,532 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 04:24:34,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 04:24:34,534 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:24:34,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:24:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 04:24:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-07-12 04:24:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 04:24:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2022-07-12 04:24:34,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 53 [2022-07-12 04:24:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:24:34,548 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2022-07-12 04:24:34,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 04:24:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-07-12 04:24:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 04:24:34,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:24:34,549 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:24:34,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 04:24:34,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:34,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:24:34,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:24:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1191046844, now seen corresponding path program 3 times [2022-07-12 04:24:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:24:34,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639178896] [2022-07-12 04:24:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:24:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:24:34,787 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:24:34,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790478814] [2022-07-12 04:24:34,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:24:34,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:24:34,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:24:34,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:24:34,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 04:24:34,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 04:24:34,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:24:34,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 04:24:34,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:24:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 04:24:38,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:24:44,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~X~0#1| 0))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~x~0#1_26| Int)) (let ((.cse1 (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~Y~0#1| .cse1 (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) 2)))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1_26| (+ |c_ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse2 (div .cse3 |c_ULTIMATE.start_main_~X~0#1|))) (= (+ (* .cse1 2) (* |c_ULTIMATE.start_main_~Y~0#1| 2) (* 2 .cse2)) (+ (* 2 (* |v_ULTIMATE.start_main_~x~0#1_26| .cse2)) |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1|))) (not (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1| 2) |c_ULTIMATE.start_main_~v~0#1|) 2) 0)) (not (= (mod .cse3 |c_ULTIMATE.start_main_~X~0#1|) 0)) (<= |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~X~0#1|)))))) (or (let ((.cse7 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse6 (+ (* (- 1) (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) 2)) (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|)))) (and (let ((.cse4 (div .cse6 |c_ULTIMATE.start_main_~Y~0#1|))) (or (<= .cse4 |c_ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse5 (div (+ (* (- 1) (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) 2)) (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|)) |c_ULTIMATE.start_main_~Y~0#1|))) (= (+ |c_ULTIMATE.start_main_~X~0#1| (* (* .cse5 |ULTIMATE.start_main_~y~0#1|) 2) |c_ULTIMATE.start_main_~v~0#1|) (+ (* (* |c_ULTIMATE.start_main_~Y~0#1| .cse5) 2) (* 2 |ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~Y~0#1| 2))))) (not (<= .cse4 (+ |c_ULTIMATE.start_main_~x~0#1| 1))) (not (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse4 2) |c_ULTIMATE.start_main_~v~0#1|) 2) 0)) (not (= (mod .cse6 |c_ULTIMATE.start_main_~Y~0#1|) 0)) .cse7)) (or (not .cse7) (forall ((|v_ULTIMATE.start_main_~x~0#1_26| Int) (|ULTIMATE.start_main_~y~0#1| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1_26| (+ |c_ULTIMATE.start_main_~x~0#1| 1))) (not (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1| 2) |c_ULTIMATE.start_main_~v~0#1|) 2) 0)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1|) 2) (* |c_ULTIMATE.start_main_~Y~0#1| 2)) (+ |c_ULTIMATE.start_main_~X~0#1| (* (* |v_ULTIMATE.start_main_~x~0#1_26| |ULTIMATE.start_main_~y~0#1|) 2) |c_ULTIMATE.start_main_~v~0#1|)) (<= |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~X~0#1|))) (not (= .cse6 0))))) (not .cse0)))) is different from false [2022-07-12 04:25:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 04:25:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:25:04,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639178896] [2022-07-12 04:25:04,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:25:04,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790478814] [2022-07-12 04:25:04,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790478814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:25:04,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:25:04,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2022-07-12 04:25:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335429669] [2022-07-12 04:25:04,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:25:04,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 04:25:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:25:04,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 04:25:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=459, Unknown=2, NotChecked=44, Total=600 [2022-07-12 04:25:04,057 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 25 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 04:25:09,954 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~X~0#1| 0))) (and (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~X~0#1|) (or .cse0 (forall ((|v_ULTIMATE.start_main_~x~0#1_26| Int)) (let ((.cse1 (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~Y~0#1| .cse1 (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) 2)))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1_26| (+ |c_ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse2 (div .cse3 |c_ULTIMATE.start_main_~X~0#1|))) (= (+ (* .cse1 2) (* |c_ULTIMATE.start_main_~Y~0#1| 2) (* 2 .cse2)) (+ (* 2 (* |v_ULTIMATE.start_main_~x~0#1_26| .cse2)) |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1|))) (not (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1| 2) |c_ULTIMATE.start_main_~v~0#1|) 2) 0)) (not (= (mod .cse3 |c_ULTIMATE.start_main_~X~0#1|) 0)) (<= |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~X~0#1|)))))) (or (let ((.cse7 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse6 (+ (* (- 1) (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) 2)) (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|)))) (and (let ((.cse4 (div .cse6 |c_ULTIMATE.start_main_~Y~0#1|))) (or (<= .cse4 |c_ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse5 (div (+ (* (- 1) (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) 2)) (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|)) |c_ULTIMATE.start_main_~Y~0#1|))) (= (+ |c_ULTIMATE.start_main_~X~0#1| (* (* .cse5 |ULTIMATE.start_main_~y~0#1|) 2) |c_ULTIMATE.start_main_~v~0#1|) (+ (* (* |c_ULTIMATE.start_main_~Y~0#1| .cse5) 2) (* 2 |ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~Y~0#1| 2))))) (not (<= .cse4 (+ |c_ULTIMATE.start_main_~x~0#1| 1))) (not (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse4 2) |c_ULTIMATE.start_main_~v~0#1|) 2) 0)) (not (= (mod .cse6 |c_ULTIMATE.start_main_~Y~0#1|) 0)) .cse7)) (or (not .cse7) (forall ((|v_ULTIMATE.start_main_~x~0#1_26| Int) (|ULTIMATE.start_main_~y~0#1| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1_26| (+ |c_ULTIMATE.start_main_~x~0#1| 1))) (not (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1| 2) |c_ULTIMATE.start_main_~v~0#1|) 2) 0)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~Y~0#1|) 2) (* |c_ULTIMATE.start_main_~Y~0#1| 2)) (+ |c_ULTIMATE.start_main_~X~0#1| (* (* |v_ULTIMATE.start_main_~x~0#1_26| |ULTIMATE.start_main_~y~0#1|) 2) |c_ULTIMATE.start_main_~v~0#1|)) (<= |v_ULTIMATE.start_main_~x~0#1_26| |c_ULTIMATE.start_main_~X~0#1|))) (not (= .cse6 0))))) (not .cse0)) (<= |c_ULTIMATE.start_main_~X~0#1| 2) (<= 0 |c_ULTIMATE.start_main_~Y~0#1|) (< |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| 2)) (<= 0 |c_ULTIMATE.start_main_~X~0#1|) (<= |c_ULTIMATE.start_main_~Y~0#1| 2))) is different from false [2022-07-12 04:25:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:25:15,061 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-07-12 04:25:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 04:25:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 53 [2022-07-12 04:25:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:25:15,062 INFO L225 Difference]: With dead ends: 57 [2022-07-12 04:25:15,062 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 04:25:15,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=149, Invalid=726, Unknown=3, NotChecked=114, Total=992 [2022-07-12 04:25:15,064 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:25:15,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 86 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 262 Invalid, 0 Unknown, 65 Unchecked, 3.2s Time] [2022-07-12 04:25:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 04:25:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 04:25:15,064 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) [2022-07-12 04:25:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 04:25:15,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-07-12 04:25:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:25:15,065 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 04:25:15,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 04:25:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 04:25:15,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 04:25:15,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 04:25:15,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 04:25:15,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:25:15,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 04:25:17,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 04:25:17,605 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~X~0#1| 2) (<= 0 |ULTIMATE.start_main_~X~0#1|)) [2022-07-12 04:25:17,606 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-07-12 04:25:17,606 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-07-12 04:25:17,606 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-07-12 04:25:17,606 INFO L902 garLoopResultBuilder]: At program point L52(lines 21 53) the Hoare annotation is: true [2022-07-12 04:25:17,606 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (or (and (= |ULTIMATE.start_main_~xy~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= .cse0 (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|)) (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~yx~0#1| 0)) (let ((.cse1 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse2 (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2))) (and (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ .cse1 (* 2 |ULTIMATE.start_main_~yx~0#1|) .cse0)) (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ .cse2 .cse0)) (<= |ULTIMATE.start_main_~X~0#1| 2) (<= 0 |ULTIMATE.start_main_~Y~0#1|) (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ .cse1 .cse2 .cse0)) (<= |ULTIMATE.start_main_~Y~0#1| 2) (<= 0 |ULTIMATE.start_main_~X~0#1|))))) [2022-07-12 04:25:17,606 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-07-12 04:25:17,607 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 45) no Hoare annotation was computed. [2022-07-12 04:25:17,607 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 45) no Hoare annotation was computed. [2022-07-12 04:25:17,607 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 04:25:17,607 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (<= |ULTIMATE.start_main_~X~0#1| 2) (<= 0 |ULTIMATE.start_main_~Y~0#1|) (<= |ULTIMATE.start_main_~Y~0#1| 2) (<= 0 |ULTIMATE.start_main_~X~0#1|) (or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2)) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)))))) [2022-07-12 04:25:17,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 04:25:17,607 INFO L899 garLoopResultBuilder]: For program point L32-3(lines 32 47) no Hoare annotation was computed. [2022-07-12 04:25:17,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 04:25:17,608 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~Y~0#1|))) (and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) .cse0)) (<= |ULTIMATE.start_main_~X~0#1| 2) (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) .cse0)) (<= 0 |ULTIMATE.start_main_~Y~0#1|) (<= |ULTIMATE.start_main_~Y~0#1| 2) (<= 0 |ULTIMATE.start_main_~X~0#1|) (or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2)) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))))) [2022-07-12 04:25:17,608 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 32 47) no Hoare annotation was computed. [2022-07-12 04:25:17,608 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2022-07-12 04:25:17,608 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-07-12 04:25:17,608 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2022-07-12 04:25:17,608 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2022-07-12 04:25:17,608 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 16) no Hoare annotation was computed. [2022-07-12 04:25:17,609 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2022-07-12 04:25:17,609 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 17) no Hoare annotation was computed. [2022-07-12 04:25:17,609 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2022-07-12 04:25:17,609 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2022-07-12 04:25:17,609 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-07-12 04:25:17,612 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-07-12 04:25:17,613 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 04:25:17,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 04:25:17 BoogieIcfgContainer [2022-07-12 04:25:17,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 04:25:17,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 04:25:17,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 04:25:17,626 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 04:25:17,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:24:29" (3/4) ... [2022-07-12 04:25:17,629 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 04:25:17,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 04:25:17,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 04:25:17,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 04:25:17,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 04:25:17,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 04:25:17,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 04:25:17,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 04:25:17,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 04:25:17,664 INFO L158 Benchmark]: Toolchain (without parser) took 49109.40ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 81.9MB in the beginning and 48.6MB in the end (delta: 33.3MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2022-07-12 04:25:17,664 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:25:17,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.74ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 85.5MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:25:17,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.73ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 84.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:25:17,665 INFO L158 Benchmark]: Boogie Preprocessor took 14.76ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:25:17,665 INFO L158 Benchmark]: RCFGBuilder took 280.18ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 72.9MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:25:17,666 INFO L158 Benchmark]: TraceAbstraction took 48533.17ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 72.5MB in the beginning and 50.7MB in the end (delta: 21.8MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2022-07-12 04:25:17,666 INFO L158 Benchmark]: Witness Printer took 37.93ms. Allocated memory is still 159.4MB. Free memory was 50.7MB in the beginning and 48.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:25:17,667 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.22ms. Allocated memory is still 109.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.74ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 85.5MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.73ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 84.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.76ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.18ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 72.9MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 48533.17ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 72.5MB in the beginning and 50.7MB in the end (delta: 21.8MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * Witness Printer took 37.93ms. Allocated memory is still 159.4MB. Free memory was 50.7MB in the beginning and 48.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: 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 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 156 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1048 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 169 mSDtfsCounter, 1048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 515 GetRequests, 388 SyntacticMatches, 6 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 30 PreInvPairs, 54 NumberOfFragments, 217 HoareAnnotationTreeSize, 30 FomulaSimplifications, 210 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3577 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 31.2s InterpolantComputationTime, 279 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 479 ConstructedInterpolants, 6 QuantifiedInterpolants, 3567 SizeOfPredicates, 38 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 309/368 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 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((X * y * 2 + X + v == Y * x * 2 + 2 * Y && X <= 2) && 0 <= Y) && Y <= 2) && 0 <= X) && (x <= X || (forall ULTIMATE.start_main_~Y~0#1 : int :: 2 * y + X * y * 2 == 2 * (x * y))) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 04:25:17,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE