./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:26:34,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:26:34,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:26:34,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:26:34,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:26:34,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:26:34,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:26:34,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:26:34,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:26:34,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:26:34,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:26:34,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:26:34,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:26:34,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:26:34,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:26:34,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:26:34,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:26:34,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:26:34,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:26:34,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:26:34,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:26:34,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:26:34,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:26:34,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:26:34,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:26:34,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:26:34,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:26:34,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:26:34,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:26:34,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:26:34,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:26:34,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:26:34,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:26:34,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:26:34,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:26:34,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:26:34,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:26:34,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:26:34,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:26:34,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:26:34,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:26:34,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:26:34,128 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:26:34,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:26:34,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:26:34,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:26:34,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:26:34,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:26:34,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:26:34,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:26:34,130 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:26:34,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:26:34,131 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:26:34,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:26:34,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:26:34,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:26:34,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:26:34,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:26:34,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:26:34,132 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:26:34,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:26:34,132 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:26:34,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:26:34,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:26:34,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:26:34,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:26:34,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:26:34,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:26:34,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:26:34,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:26:34,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:26:34,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:26:34,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:26:34,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:26:34,135 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:26:34,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:26:34,135 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:26:34,135 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a [2023-02-17 01:26:34,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:26:34,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:26:34,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:26:34,300 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:26:34,310 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:26:34,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-02-17 01:26:35,369 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:26:35,510 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:26:35,510 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-02-17 01:26:35,514 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3f9f7eb/93fad3524da14f5c89a37facfa8ce28f/FLAGdcc165649 [2023-02-17 01:26:35,538 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3f9f7eb/93fad3524da14f5c89a37facfa8ce28f [2023-02-17 01:26:35,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:26:35,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:26:35,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:26:35,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:26:35,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:26:35,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d07a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35, skipping insertion in model container [2023-02-17 01:26:35,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:26:35,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:26:35,696 WARN L237 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_unwindbound20.c[597,610] [2023-02-17 01:26:35,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:26:35,715 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:26:35,722 WARN L237 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_unwindbound20.c[597,610] [2023-02-17 01:26:35,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:26:35,735 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:26:35,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35 WrapperNode [2023-02-17 01:26:35,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:26:35,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:26:35,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:26:35,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:26:35,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,757 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-02-17 01:26:35,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:26:35,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:26:35,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:26:35,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:26:35,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,778 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:26:35,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:26:35,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:26:35,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:26:35,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (1/1) ... [2023-02-17 01:26:35,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:26:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:35,819 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) [2023-02-17 01:26:35,824 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 [2023-02-17 01:26:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:26:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:26:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:26:35,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:26:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:26:35,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:26:35,894 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:26:35,895 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:26:36,068 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:26:36,072 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:26:36,072 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 01:26:36,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:26:36 BoogieIcfgContainer [2023-02-17 01:26:36,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:26:36,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:26:36,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:26:36,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:26:36,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:26:35" (1/3) ... [2023-02-17 01:26:36,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a95804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:26:36, skipping insertion in model container [2023-02-17 01:26:36,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:26:35" (2/3) ... [2023-02-17 01:26:36,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a95804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:26:36, skipping insertion in model container [2023-02-17 01:26:36,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:26:36" (3/3) ... [2023-02-17 01:26:36,084 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2023-02-17 01:26:36,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:26:36,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:26:36,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:26:36,149 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f9b333f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:26:36,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:26:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:26:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 01:26:36,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:36,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:36,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:36,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-02-17 01:26:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:36,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995547335] [2023-02-17 01:26:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:36,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:36,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201502084] [2023-02-17 01:26:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:36,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:36,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:36,223 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) [2023-02-17 01:26:36,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 01:26:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:26:36,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 01:26:36,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:26:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:26:36,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:26:36,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:26:36,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995547335] [2023-02-17 01:26:36,318 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:26:36,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201502084] [2023-02-17 01:26:36,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201502084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:26:36,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:26:36,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 01:26:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909662043] [2023-02-17 01:26:36,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:26:36,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 01:26:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:26:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 01:26:36,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 01:26:36,341 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:26:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:26:36,415 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-17 01:26:36,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:26:36,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 01:26:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:26:36,421 INFO L225 Difference]: With dead ends: 54 [2023-02-17 01:26:36,421 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 01:26:36,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:26:36,425 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:26:36,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:26:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 01:26:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-17 01:26:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:26:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-17 01:26:36,448 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-02-17 01:26:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:26:36,448 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-17 01:26:36,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:26:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-17 01:26:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 01:26:36,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:36,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:36,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 01:26:36,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 01:26:36,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-02-17 01:26:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:36,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215967743] [2023-02-17 01:26:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:36,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:36,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836658487] [2023-02-17 01:26:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:36,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:36,684 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) [2023-02-17 01:26:36,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 01:26:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:26:36,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 01:26:36,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:26:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:26:36,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:26:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:26:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:26:37,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215967743] [2023-02-17 01:26:37,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:26:37,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836658487] [2023-02-17 01:26:37,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836658487] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:26:37,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:26:37,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2023-02-17 01:26:37,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140899805] [2023-02-17 01:26:37,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:26:37,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 01:26:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:26:37,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 01:26:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:26:37,078 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:26:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:26:37,296 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-02-17 01:26:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 01:26:37,297 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-17 01:26:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:26:37,297 INFO L225 Difference]: With dead ends: 42 [2023-02-17 01:26:37,297 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 01:26:37,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-17 01:26:37,299 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:26:37,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:26:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 01:26:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-17 01:26:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:26:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-17 01:26:37,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-02-17 01:26:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:26:37,304 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-17 01:26:37,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:26:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-17 01:26:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 01:26:37,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:37,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:37,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 01:26:37,513 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,SelfDestructingSolverStorable1 [2023-02-17 01:26:37,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:37,514 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-02-17 01:26:37,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:37,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980946480] [2023-02-17 01:26:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:37,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:37,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:37,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838100852] [2023-02-17 01:26:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:37,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:37,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:37,540 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) [2023-02-17 01:26:37,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 01:26:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:26:37,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 01:26:37,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:26:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:26:37,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:26:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:26:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:26:37,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980946480] [2023-02-17 01:26:37,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:26:37,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838100852] [2023-02-17 01:26:37,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838100852] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:26:37,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:26:37,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-17 01:26:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90345505] [2023-02-17 01:26:37,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:26:37,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 01:26:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:26:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 01:26:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:26:37,598 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:26:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:26:37,635 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-17 01:26:37,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 01:26:37,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-17 01:26:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:26:37,636 INFO L225 Difference]: With dead ends: 73 [2023-02-17 01:26:37,637 INFO L226 Difference]: Without dead ends: 67 [2023-02-17 01:26:37,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-17 01:26:37,638 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:26:37,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:26:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-17 01:26:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-17 01:26:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 01:26:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-17 01:26:37,646 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-02-17 01:26:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:26:37,646 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-17 01:26:37,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:26:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-17 01:26:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 01:26:37,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:37,647 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:37,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 01:26:37,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:37,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-02-17 01:26:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:37,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609593365] [2023-02-17 01:26:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:37,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:37,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499417218] [2023-02-17 01:26:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:37,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:37,891 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) [2023-02-17 01:26:37,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 01:26:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:26:37,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 01:26:37,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:26:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:26:38,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:26:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:26:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:26:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609593365] [2023-02-17 01:26:38,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:26:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499417218] [2023-02-17 01:26:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499417218] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:26:38,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:26:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-02-17 01:26:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644474879] [2023-02-17 01:26:38,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:26:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 01:26:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:26:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 01:26:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-02-17 01:26:38,271 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:26:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:26:38,833 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-17 01:26:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 01:26:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-02-17 01:26:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:26:38,835 INFO L225 Difference]: With dead ends: 65 [2023-02-17 01:26:38,835 INFO L226 Difference]: Without dead ends: 57 [2023-02-17 01:26:38,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 01:26:38,836 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:26:38,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 89 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 01:26:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-17 01:26:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-17 01:26:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:26:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 01:26:38,847 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-02-17 01:26:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:26:38,848 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 01:26:38,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:26:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 01:26:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 01:26:38,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:38,849 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:38,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 01:26:39,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:39,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-02-17 01:26:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787704498] [2023-02-17 01:26:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:39,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:39,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991276365] [2023-02-17 01:26:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:39,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:39,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:39,067 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) [2023-02-17 01:26:39,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 01:26:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:26:39,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 01:26:39,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:26:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:26:39,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:26:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 01:26:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:26:39,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787704498] [2023-02-17 01:26:39,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:26:39,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991276365] [2023-02-17 01:26:39,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991276365] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:26:39,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:26:39,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-17 01:26:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583603300] [2023-02-17 01:26:39,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:26:39,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 01:26:39,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:26:39,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 01:26:39,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:26:39,180 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 01:26:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:26:39,276 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-17 01:26:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 01:26:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-02-17 01:26:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:26:39,280 INFO L225 Difference]: With dead ends: 116 [2023-02-17 01:26:39,281 INFO L226 Difference]: Without dead ends: 110 [2023-02-17 01:26:39,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-17 01:26:39,285 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:26:39,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 137 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:26:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-17 01:26:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-17 01:26:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 01:26:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-02-17 01:26:39,316 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-02-17 01:26:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:26:39,317 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-02-17 01:26:39,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 01:26:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-02-17 01:26:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-17 01:26:39,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:39,323 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:39,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 01:26:39,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:39,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-02-17 01:26:39,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:39,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072828008] [2023-02-17 01:26:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:39,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:39,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278893701] [2023-02-17 01:26:39,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:26:39,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:39,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:39,553 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) [2023-02-17 01:26:39,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 01:26:39,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:26:39,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:26:39,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 01:26:39,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:26:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:26:39,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:26:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-17 01:26:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:26:39,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072828008] [2023-02-17 01:26:39,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:26:39,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278893701] [2023-02-17 01:26:39,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278893701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:26:39,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:26:39,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-17 01:26:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581967898] [2023-02-17 01:26:39,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:26:39,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 01:26:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:26:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 01:26:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-17 01:26:39,809 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-02-17 01:26:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:26:40,038 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2023-02-17 01:26:40,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 01:26:40,038 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 109 [2023-02-17 01:26:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:26:40,041 INFO L225 Difference]: With dead ends: 216 [2023-02-17 01:26:40,041 INFO L226 Difference]: Without dead ends: 210 [2023-02-17 01:26:40,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-02-17 01:26:40,044 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 138 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:26:40,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 221 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:26:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-17 01:26:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-02-17 01:26:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.125) internal successors, (189), 168 states have internal predecessors, (189), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 01:26:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2023-02-17 01:26:40,082 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 109 [2023-02-17 01:26:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:26:40,083 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2023-02-17 01:26:40,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-02-17 01:26:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2023-02-17 01:26:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-17 01:26:40,089 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:40,090 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:40,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 01:26:40,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:40,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash -661676624, now seen corresponding path program 3 times [2023-02-17 01:26:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003494965] [2023-02-17 01:26:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:40,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:40,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336930936] [2023-02-17 01:26:40,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 01:26:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:40,332 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) [2023-02-17 01:26:40,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 01:26:40,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 01:26:40,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:26:40,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 01:26:40,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:26:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 212 proven. 1 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-02-17 01:26:40,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:26:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 96 proven. 117 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-02-17 01:26:40,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:26:40,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003494965] [2023-02-17 01:26:40,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:26:40,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336930936] [2023-02-17 01:26:40,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336930936] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:26:40,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:26:40,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-17 01:26:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925808153] [2023-02-17 01:26:40,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:26:40,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 01:26:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:26:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 01:26:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-17 01:26:40,576 INFO L87 Difference]: Start difference. First operand 210 states and 230 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:26:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:26:40,741 INFO L93 Difference]: Finished difference Result 409 states and 448 transitions. [2023-02-17 01:26:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 01:26:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 209 [2023-02-17 01:26:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:26:40,746 INFO L225 Difference]: With dead ends: 409 [2023-02-17 01:26:40,746 INFO L226 Difference]: Without dead ends: 403 [2023-02-17 01:26:40,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 398 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-17 01:26:40,747 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:26:40,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 63 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:26:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-02-17 01:26:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2023-02-17 01:26:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 320 states have (on average 1.125) internal successors, (360), 320 states have internal predecessors, (360), 40 states have call successors, (40), 40 states have call predecessors, (40), 39 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-02-17 01:26:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 439 transitions. [2023-02-17 01:26:40,798 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 439 transitions. Word has length 209 [2023-02-17 01:26:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:26:40,798 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 439 transitions. [2023-02-17 01:26:40,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:26:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 439 transitions. [2023-02-17 01:26:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-17 01:26:40,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:26:40,800 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:26:40,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 01:26:41,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:41,005 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:26:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:26:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash 18381746, now seen corresponding path program 1 times [2023-02-17 01:26:41,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:26:41,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903953696] [2023-02-17 01:26:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:26:41,015 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:26:41,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020563184] [2023-02-17 01:26:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:26:41,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:26:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:26:41,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:26:41,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 01:26:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 01:26:41,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 01:26:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 01:26:41,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 01:26:41,250 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 01:26:41,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:26:41,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 01:26:41,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 01:26:41,459 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-02-17 01:26:41,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:26:41,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:26:41 BoogieIcfgContainer [2023-02-17 01:26:41,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:26:41,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:26:41,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:26:41,544 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:26:41,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:26:36" (3/4) ... [2023-02-17 01:26:41,545 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 01:26:41,592 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:26:41,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:26:41,593 INFO L158 Benchmark]: Toolchain (without parser) took 6052.17ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 79.9MB in the beginning and 95.5MB in the end (delta: -15.6MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2023-02-17 01:26:41,593 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:26:41,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.36ms. Allocated memory is still 125.8MB. Free memory was 79.5MB in the beginning and 68.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:26:41,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.57ms. Allocated memory is still 125.8MB. Free memory was 68.9MB in the beginning and 67.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:26:41,593 INFO L158 Benchmark]: Boogie Preprocessor took 22.55ms. Allocated memory is still 125.8MB. Free memory was 67.7MB in the beginning and 66.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:26:41,593 INFO L158 Benchmark]: RCFGBuilder took 292.16ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 66.5MB in the beginning and 120.9MB in the end (delta: -54.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-02-17 01:26:41,594 INFO L158 Benchmark]: TraceAbstraction took 5463.30ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 122.9MB in the beginning and 105.0MB in the end (delta: 17.9MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2023-02-17 01:26:41,594 INFO L158 Benchmark]: Witness Printer took 48.97ms. Allocated memory is still 182.5MB. Free memory was 103.9MB in the beginning and 95.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 01:26:41,595 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.11ms. Allocated memory is still 125.8MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.36ms. Allocated memory is still 125.8MB. Free memory was 79.5MB in the beginning and 68.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.57ms. Allocated memory is still 125.8MB. Free memory was 68.9MB in the beginning and 67.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.55ms. Allocated memory is still 125.8MB. Free memory was 67.7MB in the beginning and 66.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 292.16ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 66.5MB in the beginning and 120.9MB in the end (delta: -54.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5463.30ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 122.9MB in the beginning and 105.0MB in the end (delta: 17.9MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Witness Printer took 48.97ms. Allocated memory is still 182.5MB. Free memory was 103.9MB in the beginning and 95.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-38, X=40, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-38, x=0, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-38, X=40, x=0, x=0, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-38, x=0, X=40, x=0, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-38, x=0, x=0, x=0, X=40, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-36, x=0, x=0, X=40, x=0, y=0, Y=1] [L45] x++ VAL [counter=1, v=-36, X=40, x=1, x=0, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-36, X=40, x=0, x=1, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-36, X=40, x=1, x=0, x=1, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-36, x=1, X=40, x=1, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-36, x=1, x=1, X=40, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-34, x=1, x=0, x=1, X=40, Y=1, y=0] [L45] x++ VAL [counter=2, v=-34, X=40, x=0, x=1, x=2, y=0, Y=1] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-34, x=1, X=40, x=0, x=2, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-34, x=2, x=0, X=40, x=2, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-34, X=40, x=0, x=2, x=2, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-34, x=2, x=0, x=2, X=40, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-32, x=0, X=40, x=2, x=2, Y=1, y=0] [L45] x++ VAL [counter=3, v=-32, x=0, x=2, X=40, x=3, y=0, Y=1] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-32, x=2, x=0, x=3, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-32, x=3, x=0, x=3, X=40, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-32, x=0, X=40, x=3, x=3, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-32, x=3, X=40, x=3, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-30, x=0, x=3, X=40, x=3, y=0, Y=1] [L45] x++ VAL [counter=4, v=-30, x=0, x=4, X=40, x=3, Y=1, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-30, X=40, x=0, x=4, x=3, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-30, x=0, x=4, X=40, x=4, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-30, x=4, x=0, X=40, x=4, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-30, x=0, X=40, x=4, x=4, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-28, x=4, X=40, x=0, x=4, Y=1, y=0] [L45] x++ VAL [counter=5, v=-28, x=5, x=4, x=0, X=40, Y=1, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-28, x=0, x=4, X=40, x=5, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-28, x=5, x=5, x=0, X=40, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-28, x=5, X=40, x=0, x=5, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-28, x=5, x=0, x=5, X=40, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-26, x=5, X=40, x=0, x=5, Y=1, y=0] [L45] x++ VAL [counter=6, v=-26, x=0, x=5, X=40, x=6, Y=1, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-26, x=0, X=40, x=5, x=6, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-26, x=0, x=6, x=6, X=40, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-26, X=40, x=0, x=6, x=6, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-26, x=6, x=6, X=40, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-24, x=6, X=40, x=6, x=0, y=0, Y=1] [L45] x++ VAL [counter=7, v=-24, x=0, X=40, x=7, x=6, Y=1, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-24, x=7, x=6, X=40, x=0, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-24, x=7, x=7, X=40, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-24, x=0, x=7, X=40, x=7, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-24, x=0, X=40, x=7, x=7, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-22, X=40, x=0, x=7, x=7, Y=1, y=0] [L45] x++ VAL [counter=8, v=-22, x=7, x=8, x=0, X=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-22, x=8, X=40, x=0, x=7, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-22, x=8, x=0, X=40, x=8, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-22, x=8, x=8, X=40, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-22, x=8, x=8, X=40, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-20, x=8, X=40, x=0, x=8, y=0, Y=1] [L45] x++ VAL [counter=9, v=-20, X=40, x=8, x=0, x=9, y=0, Y=1] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-20, x=0, x=9, X=40, x=8, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-20, x=9, x=0, X=40, x=9, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-20, X=40, x=9, x=9, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-20, x=9, x=9, X=40, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-18, X=40, x=0, x=9, x=9, Y=1, y=0] [L45] x++ VAL [counter=10, v=-18, x=10, X=40, x=9, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-18, X=40, x=9, x=10, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-18, x=0, x=10, X=40, x=10, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-18, x=10, x=10, X=40, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-18, x=0, x=10, X=40, x=10, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-16, x=10, x=10, X=40, x=0, y=0, Y=1] [L45] x++ VAL [counter=11, v=-16, x=0, X=40, x=10, x=11, Y=1, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-16, x=10, x=0, x=11, X=40, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-16, X=40, x=11, x=0, x=11, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-16, X=40, x=11, x=0, x=11, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-16, x=11, x=11, x=0, X=40, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-14, X=40, x=11, x=11, x=0, y=0, Y=1] [L45] x++ VAL [counter=12, v=-14, x=12, x=11, x=0, X=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-14, x=12, x=0, X=40, x=11, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-14, x=12, X=40, x=0, x=12, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-14, X=40, x=12, x=12, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-14, x=12, X=40, x=12, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-12, x=12, X=40, x=12, x=0, y=0, Y=1] [L45] x++ VAL [counter=13, v=-12, X=40, x=13, x=0, x=12, y=0, Y=1] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-12, X=40, x=13, x=0, x=12, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-12, X=40, x=13, x=13, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-12, x=13, x=13, x=0, X=40, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-12, x=0, x=13, x=13, X=40, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-10, x=13, x=0, x=13, X=40, Y=1, y=0] [L45] x++ VAL [counter=14, v=-10, x=14, x=13, X=40, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-10, X=40, x=13, x=14, x=0, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-10, X=40, x=14, x=14, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-10, x=14, X=40, x=0, x=14, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-10, x=14, x=0, X=40, x=14, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-8, x=0, x=14, X=40, x=14, Y=1, y=0] [L45] x++ VAL [counter=15, v=-8, x=15, X=40, x=0, x=14, Y=1, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-8, x=15, x=14, x=0, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-8, x=0, X=40, x=15, x=15, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-8, x=15, x=15, x=0, X=40, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-8, x=15, x=0, X=40, x=15, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-6, x=15, x=15, x=0, X=40, Y=1, y=0] [L45] x++ VAL [counter=16, v=-6, x=15, X=40, x=0, x=16, Y=1, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-6, x=0, x=15, x=16, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-6, x=16, x=0, X=40, x=16, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-6, x=16, x=0, X=40, x=16, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-6, X=40, x=16, x=0, x=16, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-4, x=16, x=16, X=40, x=0, y=0, Y=1] [L45] x++ VAL [counter=17, v=-4, x=16, X=40, x=0, x=17, y=0, Y=1] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-4, X=40, x=16, x=0, x=17, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-4, x=17, x=17, x=0, X=40, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-4, X=40, x=17, x=17, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-4, x=17, X=40, x=17, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-2, x=0, X=40, x=17, x=17, y=0, Y=1] [L45] x++ VAL [counter=18, v=-2, x=18, x=0, x=17, X=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-2, x=17, x=18, x=0, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-2, x=18, x=18, x=0, X=40, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-2, x=18, X=40, x=18, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-2, x=18, x=18, x=0, X=40, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=0, x=18, x=18, x=0, X=40, y=0, Y=1] [L45] x++ VAL [counter=19, v=0, x=18, x=19, x=0, X=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=0, x=19, x=18, x=0, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=0, X=40, x=19, x=19, x=0, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=0, x=19, x=0, X=40, x=19, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=0, x=19, x=0, X=40, x=19, Y=1, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=20, v=-78, x=19, x=19, X=40, x=0, Y=1, y=1] [L45] x++ VAL [counter=20, v=-78, x=0, X=40, x=20, x=19, y=1, Y=1] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-78, X=40, x=19, x=0, x=20, Y=1, y=1] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=21, v=-78, x=20, X=40, x=20, x=20, y=1, Y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 587 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 846 IncrementalHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 123 mSDtfsCounter, 846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 913 GetRequests, 750 SyntacticMatches, 7 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=7, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 646 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 853 ConstructedInterpolants, 1 QuantifiedInterpolants, 3834 SizeOfPredicates, 47 NumberOfNonLiveVariables, 835 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 4127/5134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-17 01:26:41,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE