./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound10.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03fe66fa Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound10.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-03fe66f-m [2024-08-15 18:26:39,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:26:39,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-15 18:26:39,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:26:39,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:26:40,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:26:40,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:26:40,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:26:40,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:26:40,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:26:40,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:26:40,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:26:40,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:26:40,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:26:40,026 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:26:40,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:26:40,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:26:40,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-15 18:26:40,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:26:40,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-15 18:26:40,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:26:40,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:26:40,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:26:40,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:26:40,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:26:40,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-15 18:26:40,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:26:40,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:26:40,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:26:40,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:26:40,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:26:40,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:26:40,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:26:40,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:26:40,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:26:40,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:26:40,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:26:40,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:26:40,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:26:40,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:26:40,032 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:26:40,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:26:40,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:26:40,033 INFO L153 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-15 18:26:40,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:26:40,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:26:40,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:26:40,276 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:26:40,276 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:26:40,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/bresenham-ll_unwindbound10.yml/witness.yml [2024-08-15 18:26:40,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:26:40,420 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:26:40,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2024-08-15 18:26:41,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:26:41,836 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:26:41,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2024-08-15 18:26:41,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a5b11b3e/a61acb1aa67645d4b19459bd2701ebd1/FLAG77a36f0f0 [2024-08-15 18:26:41,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a5b11b3e/a61acb1aa67645d4b19459bd2701ebd1 [2024-08-15 18:26:41,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:26:41,857 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:26:41,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:26:41,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:26:41,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:26:41,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:26:40" (1/2) ... [2024-08-15 18:26:41,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed686d6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:26:41, skipping insertion in model container [2024-08-15 18:26:41,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:26:40" (1/2) ... [2024-08-15 18:26:41,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d035ce9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:26:41, skipping insertion in model container [2024-08-15 18:26:41,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:26:41" (2/2) ... [2024-08-15 18:26:41,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed686d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:41, skipping insertion in model container [2024-08-15 18:26:41,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:26:41" (2/2) ... [2024-08-15 18:26:41,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:26:42,018 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c[597,610] [2024-08-15 18:26:42,041 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:26:42,049 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:26:42,058 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c[597,610] [2024-08-15 18:26:42,063 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:26:42,082 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:26:42,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42 WrapperNode [2024-08-15 18:26:42,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:26:42,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:26:42,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:26:42,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:26:42,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,111 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-15 18:26:42,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:26:42,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:26:42,117 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:26:42,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:26:42,118 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (1/1) ... [2024-08-15 18:26:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:26:42,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:26:42,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-15 18:26:42,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-15 18:26:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:26:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:26:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:26:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:26:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:26:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:26:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:26:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:26:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:26:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:26:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:26:42,256 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:26:42,258 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:26:42,382 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-08-15 18:26:42,382 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:26:42,389 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:26:42,389 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:26:42,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:26:42 BoogieIcfgContainer [2024-08-15 18:26:42,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:26:42,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:26:42,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:26:42,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:26:42,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:26:40" (1/4) ... [2024-08-15 18:26:42,395 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:26:42,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5074ba4b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:26:42, skipping insertion in model container [2024-08-15 18:26:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:26:41" (2/4) ... [2024-08-15 18:26:42,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5074ba4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:26:42, skipping insertion in model container [2024-08-15 18:26:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:26:42" (3/4) ... [2024-08-15 18:26:42,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5074ba4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:26:42, skipping insertion in model container [2024-08-15 18:26:42,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:26:42" (4/4) ... [2024-08-15 18:26:42,399 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2024-08-15 18:26:42,417 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:26:42,418 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:26:42,443 INFO L90 WitnessUtils]: Constructing product of automaton with 27 states and violation witness of the following lengths: [64] [2024-08-15 18:26:42,579 INFO L95 WitnessUtils]: Product has 996 reachable states. [2024-08-15 18:26:42,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:26:42,604 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@ea3f8be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:26:42,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:26:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1150 transitions. [2024-08-15 18:26:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-08-15 18:26:42,635 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:26:42,636 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:26:42,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:26:42,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:26:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash 676257950, now seen corresponding path program 1 times [2024-08-15 18:26:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:26:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039405963] [2024-08-15 18:26:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:26:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:26:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-08-15 18:26:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-08-15 18:26:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-08-15 18:26:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-08-15 18:26:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:26:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-08-15 18:26:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-08-15 18:26:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-08-15 18:26:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-15 18:26:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-15 18:26:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-08-15 18:26:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:26:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039405963] [2024-08-15 18:26:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039405963] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:26:43,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:26:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-15 18:26:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134798976] [2024-08-15 18:26:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:26:43,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-15 18:26:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:26:43,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-15 18:26:43,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-15 18:26:43,091 INFO L87 Difference]: Start difference. First operand 996 states and 1150 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:26:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:26:43,167 INFO L93 Difference]: Finished difference Result 639 states and 671 transitions. [2024-08-15 18:26:43,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-15 18:26:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 132 [2024-08-15 18:26:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:26:43,178 INFO L225 Difference]: With dead ends: 639 [2024-08-15 18:26:43,179 INFO L226 Difference]: Without dead ends: 253 [2024-08-15 18:26:43,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-15 18:26:43,184 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:26:43,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:26:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-08-15 18:26:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 144. [2024-08-15 18:26:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.1025641025641026) internal successors, (129), 117 states have internal predecessors, (129), 14 states have call successors, (14), 14 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-08-15 18:26:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2024-08-15 18:26:43,228 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 132 [2024-08-15 18:26:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:26:43,229 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2024-08-15 18:26:43,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:26:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2024-08-15 18:26:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-08-15 18:26:43,231 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:26:43,231 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:26:43,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-15 18:26:43,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:26:43,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:26:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -622616928, now seen corresponding path program 1 times [2024-08-15 18:26:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:26:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560381907] [2024-08-15 18:26:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:26:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-08-15 18:26:43,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095480867] [2024-08-15 18:26:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:43,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:26:43,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:26:43,360 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) [2024-08-15 18:26:43,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-15 18:26:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:26:43,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:26:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:26:43,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:26:43,544 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:26:43,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:26:43,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-15 18:26:43,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:26:43,751 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-15 18:26:43,754 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:26:43,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:26:43 BoogieIcfgContainer [2024-08-15 18:26:43,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:26:43,821 INFO L158 Benchmark]: Toolchain (without parser) took 1964.17ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 61.8MB in the beginning and 103.5MB in the end (delta: -41.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:26:43,821 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:26:43,822 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 138.4MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:26:43,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.69ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 61.6MB in the beginning and 146.2MB in the end (delta: -84.6MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-08-15 18:26:43,822 INFO L158 Benchmark]: Boogie Preprocessor took 33.46ms. Allocated memory is still 176.2MB. Free memory was 146.2MB in the beginning and 145.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:26:43,823 INFO L158 Benchmark]: IcfgBuilder took 272.41ms. Allocated memory is still 176.2MB. Free memory was 145.0MB in the beginning and 131.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-15 18:26:43,824 INFO L158 Benchmark]: TraceAbstraction took 1429.23ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 103.5MB in the end (delta: 26.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-08-15 18:26:43,825 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.93ms. Allocated memory is still 138.4MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.69ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 61.6MB in the beginning and 146.2MB in the end (delta: -84.6MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.46ms. Allocated memory is still 176.2MB. Free memory was 146.2MB in the beginning and 145.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 272.41ms. Allocated memory is still 176.2MB. Free memory was 145.0MB in the beginning and 131.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1429.23ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 103.5MB in the end (delta: 26.8MB). Peak memory consumption was 23.5MB. 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 [\old(counter)=21, 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 [X=20, Y=1, \old(counter)=0, counter=0, v=-18, x=0, y=0] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=1, v=-18, x=0, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=1, v=-18, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=1, v=-18, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=1, v=-18, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=1, v=-16, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=1, v=-16, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=2, v=-16, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=2, v=-16, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=2, v=-16, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=2, v=-16, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=2, v=-14, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=2, v=-14, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=3, v=-14, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=3, v=-14, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=3, v=-14, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=3, v=-14, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=3, v=-12, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=3, v=-12, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=4, v=-12, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=4, v=-12, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=4, v=-12, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=4, v=-12, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=4, v=-10, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=4, v=-10, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=5, v=-10, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=5, v=-10, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=5, v=-10, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=5, v=-10, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=5, v=-8, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=5, v=-8, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=6, v=-8, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=6, v=-8, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=6, v=-8, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=6, v=-8, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=6, v=-6, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=6, v=-6, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=7, v=-6, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=7, v=-6, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=7, v=-6, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=7, v=-6, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=7, v=-4, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=7, v=-4, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=8, v=-4, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=8, v=-4, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=8, v=-4, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=8, v=-4, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=8, v=-2, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=8, v=-2, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=9, v=-2, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=9, v=-2, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=9, v=-2, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=9, v=-2, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, \old(counter)=0, counter=9, v=0, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=9, v=0, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=10, v=0, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, \old(counter)=0, counter=10, v=0, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, \old(counter)=0, counter=10, v=0, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, \old(counter)=0, counter=10, v=0, x=9, xy=0, y=0, yx=9] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=20, Y=1, \old(counter)=0, counter=10, v=-38, x=9, xy=0, y=1, yx=9] [L45] x++ VAL [X=20, Y=1, \old(counter)=0, counter=10, v=-38, x=10, xy=0, y=1, yx=9] [L31] EXPR counter++ VAL [X=20, Y=1, \old(counter)=0, counter=11, v=-38, x=10, xy=0, y=1, yx=9] [L31] COND FALSE !(counter++<10) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=20, Y=1, \old(counter)=0, counter=11, v=-38, xy=10, y=1, yx=10] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 24 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=996occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 109 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 570/570 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! [2024-08-15 18:26:43,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (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