./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.count2.yml/witness.yml -tc ../../../trunk/examples/toolchains/AutomizerC_IcfgBuilder.xml -s ../../../trunk/examples/settings/svcomp-Reach-32bit-Automizer_IcfgBuilder.epf --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bf1304be 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/hardware-verification-bv/btor2c-lazyMod.count2.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.count2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false -tc ../../../trunk/examples/toolchains/AutomizerC_IcfgBuilder.xml -s ../../../trunk/examples/settings/svcomp-Reach-32bit-Automizer_IcfgBuilder.epf --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-bf1304b-m [2024-08-06 17:17:25,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-06 17:17:26,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-06 17:17:26,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-06 17:17:26,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-06 17:17:26,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-06 17:17:26,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-06 17:17:26,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-06 17:17:26,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-06 17:17:26,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-06 17:17:26,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-06 17:17:26,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-06 17:17:26,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-06 17:17:26,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-06 17:17:26,072 INFO L153 SettingsManager]: * Use SBE=true [2024-08-06 17:17:26,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-06 17:17:26,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-06 17:17:26,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-06 17:17:26,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-06 17:17:26,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-06 17:17:26,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-06 17:17:26,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-06 17:17:26,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-06 17:17:26,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-06 17:17:26,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-06 17:17:26,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-06 17:17:26,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-06 17:17:26,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-06 17:17:26,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-06 17:17:26,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-06 17:17:26,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-06 17:17:26,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-06 17:17:26,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-06 17:17:26,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-06 17:17:26,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-06 17:17:26,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-06 17:17:26,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-06 17:17:26,081 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-06 17:17:26,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-06 17:17:26,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-06 17:17:26,082 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 [2024-08-06 17:17:26,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-06 17:17:26,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-06 17:17:26,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-06 17:17:26,375 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-06 17:17:26,375 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-06 17:17:26,377 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/btor2c-lazyMod.count2.yml/witness.yml [2024-08-06 17:17:26,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-06 17:17:26,451 INFO L274 PluginConnector]: CDTParser initialized [2024-08-06 17:17:26,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-08-06 17:17:27,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-06 17:17:28,037 INFO L384 CDTParser]: Found 1 translation units. [2024-08-06 17:17:28,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-08-06 17:17:28,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ff2ad13/4ae6ba6e70674ec09e15488450d17da1/FLAG9d50d2998 [2024-08-06 17:17:28,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ff2ad13/4ae6ba6e70674ec09e15488450d17da1 [2024-08-06 17:17:28,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-06 17:17:28,086 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-06 17:17:28,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-06 17:17:28,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-06 17:17:28,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-06 17:17:28,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 06.08 05:17:26" (1/2) ... [2024-08-06 17:17:28,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44311263 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 06.08 05:17:28, skipping insertion in model container [2024-08-06 17:17:28,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 06.08 05:17:26" (1/2) ... [2024-08-06 17:17:28,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1bdb2aed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 06.08 05:17:28, skipping insertion in model container [2024-08-06 17:17:28,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 05:17:28" (2/2) ... [2024-08-06 17:17:28,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44311263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28, skipping insertion in model container [2024-08-06 17:17:28,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 05:17:28" (2/2) ... [2024-08-06 17:17:28,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-06 17:17:28,252 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2024-08-06 17:17:28,276 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-06 17:17:28,284 INFO L200 MainTranslator]: Completed pre-run [2024-08-06 17:17:28,293 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2024-08-06 17:17:28,303 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-06 17:17:28,325 INFO L204 MainTranslator]: Completed translation [2024-08-06 17:17:28,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28 WrapperNode [2024-08-06 17:17:28,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-06 17:17:28,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-06 17:17:28,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-06 17:17:28,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-06 17:17:28,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,372 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2024-08-06 17:17:28,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-06 17:17:28,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-06 17:17:28,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-06 17:17:28,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-06 17:17:28,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,413 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-06 17:17:28,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-06 17:17:28,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-06 17:17:28,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-06 17:17:28,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-06 17:17:28,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (1/1) ... [2024-08-06 17:17:28,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-06 17:17:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-06 17:17:28,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-08-06 17:17:28,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-08-06 17:17:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-06 17:17:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-06 17:17:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-06 17:17:28,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-06 17:17:28,632 INFO L244 CfgBuilder]: Building ICFG [2024-08-06 17:17:28,636 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-06 17:17:28,837 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-08-06 17:17:28,837 INFO L293 CfgBuilder]: Performing block encoding [2024-08-06 17:17:28,861 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-06 17:17:28,861 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-08-06 17:17:28,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 05:17:28 BoogieIcfgContainer [2024-08-06 17:17:28,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-06 17:17:28,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-06 17:17:28,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-06 17:17:28,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-06 17:17:28,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 06.08 05:17:26" (1/4) ... [2024-08-06 17:17:28,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15445e36 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 06.08 05:17:28, skipping insertion in model container [2024-08-06 17:17:28,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 05:17:28" (2/4) ... [2024-08-06 17:17:28,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15445e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 05:17:28, skipping insertion in model container [2024-08-06 17:17:28,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 05:17:28" (3/4) ... [2024-08-06 17:17:28,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15445e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 05:17:28, skipping insertion in model container [2024-08-06 17:17:28,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 05:17:28" (4/4) ... [2024-08-06 17:17:28,869 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2024-08-06 17:17:28,869 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-06 17:17:28,888 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-06 17:17:28,889 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-06 17:17:28,938 INFO L90 WitnessUtils]: FiniteAutomaton nwa = ( alphabet = {"assume !(0 == (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));" "assume (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise6#1 := (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise5#1 := 0;" "assume !((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));assume ((((((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise6#1 <= (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296)) && (((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise6#1 <= (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && (((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise6#1 >= 0)) && (((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise6#1 > (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) + (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && main_#t~bitwise6#1 >= -2147483648;" "assume !(0 == (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));" "main_~var_6~0#1 := main_#t~bitwise6#1;havoc main_#t~bitwise6#1;main_~next_7_arg_1~0#1 := main_~var_6~0#1;main_~state_3~0#1 := main_~next_7_arg_1~0#1;havoc main_~var_10_arg_0~0#1, main_~var_10_arg_1~0#1, main_~var_10~0#1, main_~bad_11_arg_0~0#1, main_~var_6_arg_0~0#1, main_~var_6_arg_1~0#1, main_~var_6~0#1, main_~next_7_arg_1~0#1;" "assume (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise5#1 := (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296);" "assume !((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));assume ((((((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise5#1 <= (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296)) && (((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise5#1 <= (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && (((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise5#1 >= 0)) && (((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise5#1 > (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) + (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && main_#t~bitwise5#1 >= -2147483648;" "main_~state_3~0#1 := main_#t~bitwise5#1;havoc main_#t~nondet4#1;havoc main_#t~bitwise5#1;main_~init_4_arg_1~0#1 := main_~var_2~0#1;main_~state_3~0#1 := main_~init_4_arg_1~0#1;" "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~bitwise5#1, main_#t~bitwise6#1, main_~var_10_arg_0~0#1, main_~var_10_arg_1~0#1, main_~var_10~0#1, main_~bad_11_arg_0~0#1, main_~var_6_arg_0~0#1, main_~var_6_arg_1~0#1, main_~var_6~0#1, main_~next_7_arg_1~0#1, main_~mask_SORT_1~0#1, main_~msb_SORT_1~0#1, main_~mask_SORT_9~0#1, main_~msb_SORT_9~0#1, main_~var_2~0#1, main_~var_5~0#1, main_~var_8~0#1, main_~state_3~0#1, main_~init_4_arg_1~0#1;main_~mask_SORT_1~0#1 := 7;main_~msb_SORT_1~0#1 := 4;main_~mask_SORT_9~0#1 := 1;main_~msb_SORT_9~0#1 := 1;main_~var_2~0#1 := 0;main_~var_5~0#1 := 1;main_~var_8~0#1 := main_~mask_SORT_1~0#1;havoc main_#t~nondet4#1;" "assume !true;main_#res#1 := 0;#t~ret7#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~bitwise5#1, main_#t~bitwise6#1, main_~var_10_arg_0~0#1, main_~var_10_arg_1~0#1, main_~var_10~0#1, main_~bad_11_arg_0~0#1, main_~var_6_arg_0~0#1, main_~var_6_arg_1~0#1, main_~var_6~0#1, main_~next_7_arg_1~0#1, main_~mask_SORT_1~0#1, main_~msb_SORT_1~0#1, main_~mask_SORT_9~0#1, main_~msb_SORT_9~0#1, main_~var_2~0#1, main_~var_5~0#1, main_~var_8~0#1, main_~state_3~0#1, main_~init_4_arg_1~0#1;assume { :end_inline_main } true;assume true;" "main_~var_10_arg_0~0#1 := main_~state_3~0#1;main_~var_10_arg_1~0#1 := main_~var_8~0#1;main_~var_10~0#1 := (if (if main_~var_10_arg_0~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_10_arg_0~0#1 % 256 % 4294967296 else main_~var_10_arg_0~0#1 % 256 % 4294967296 - 4294967296) == (if main_~var_10_arg_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_10_arg_1~0#1 % 256 % 4294967296 else main_~var_10_arg_1~0#1 % 256 % 4294967296 - 4294967296) then 1 else 0);main_~bad_11_arg_0~0#1 := main_~var_10~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~bad_11_arg_0~0#1 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume 0 == __VERIFIER_assert_~cond#1;" "assume !false;" "assume false;assume false;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~var_6_arg_0~0#1 := main_~state_3~0#1;main_~var_6_arg_1~0#1 := main_~var_5~0#1;main_~var_6~0#1 := (if main_~var_6_arg_0~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6_arg_0~0#1 % 256 % 4294967296 else main_~var_6_arg_0~0#1 % 256 % 4294967296 - 4294967296) + (if main_~var_6_arg_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6_arg_1~0#1 % 256 % 4294967296 else main_~var_6_arg_1~0#1 % 256 % 4294967296 - 4294967296);" "assume 0 == (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise6#1 := 0;" }, states = {"CountingPredicate [underlying: 8#L38-2true, annotation: [0, 0]]" "CountingPredicate [underlying: 9#L55true, annotation: [0, 0]]" "CountingPredicate [underlying: 14#L38true, annotation: [0, 0]]" "CountingPredicate [underlying: 2#L42-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 3#ULTIMATE.startEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 6#L38-4true, annotation: [0, 0]]" "CountingPredicate [underlying: 10#L22true, annotation: [0, 0]]" "CountingPredicate [underlying: 5#L55-4true, annotation: [0, 0]]" "CountingPredicate [underlying: 4#L22-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 12#$Ultimate##0true, annotation: [0, 0]]" "CountingPredicate [underlying: 7#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 13#L22-3true, annotation: [0, 0]]" "CountingPredicate [underlying: 11#L55-2true, annotation: [0, 0]]" }, initialStates = {"CountingPredicate [underlying: 12#$Ultimate##0true, annotation: [0, 0]]" }, finalStates = {}, transitions = { ("CountingPredicate [underlying: 8#L38-2true, annotation: [0, 0]]" "assume (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise5#1 := (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296);" "CountingPredicate [underlying: 6#L38-4true, annotation: [0, 0]]") ("CountingPredicate [underlying: 8#L38-2true, annotation: [0, 0]]" "assume !((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));assume ((((((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise5#1 <= (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296)) && (((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise5#1 <= (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && (((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise5#1 >= 0)) && (((if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise5#1 > (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) + (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && main_#t~bitwise5#1 >= -2147483648;" "CountingPredicate [underlying: 6#L38-4true, annotation: [0, 0]]") ("CountingPredicate [underlying: 9#L55true, annotation: [0, 0]]" "assume !(0 == (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));" "CountingPredicate [underlying: 11#L55-2true, annotation: [0, 0]]") ("CountingPredicate [underlying: 9#L55true, annotation: [0, 0]]" "assume 0 == (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise6#1 := 0;" "CountingPredicate [underlying: 5#L55-4true, annotation: [0, 0]]") ("CountingPredicate [underlying: 14#L38true, annotation: [0, 0]]" "assume 0 == (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise5#1 := 0;" "CountingPredicate [underlying: 6#L38-4true, annotation: [0, 0]]") ("CountingPredicate [underlying: 14#L38true, annotation: [0, 0]]" "assume !(0 == (if main_#t~nondet4#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 256 % 4294967296 else main_#t~nondet4#1 % 256 % 4294967296 - 4294967296) || 0 == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));" "CountingPredicate [underlying: 8#L38-2true, annotation: [0, 0]]") ("CountingPredicate [underlying: 2#L42-1true, annotation: [0, 0]]" "assume !true;main_#res#1 := 0;#t~ret7#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~bitwise5#1, main_#t~bitwise6#1, main_~var_10_arg_0~0#1, main_~var_10_arg_1~0#1, main_~var_10~0#1, main_~bad_11_arg_0~0#1, main_~var_6_arg_0~0#1, main_~var_6_arg_1~0#1, main_~var_6~0#1, main_~next_7_arg_1~0#1, main_~mask_SORT_1~0#1, main_~msb_SORT_1~0#1, main_~mask_SORT_9~0#1, main_~msb_SORT_9~0#1, main_~var_2~0#1, main_~var_5~0#1, main_~var_8~0#1, main_~state_3~0#1, main_~init_4_arg_1~0#1;assume { :end_inline_main } true;assume true;" "CountingPredicate [underlying: 3#ULTIMATE.startEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 2#L42-1true, annotation: [0, 0]]" "main_~var_10_arg_0~0#1 := main_~state_3~0#1;main_~var_10_arg_1~0#1 := main_~var_8~0#1;main_~var_10~0#1 := (if (if main_~var_10_arg_0~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_10_arg_0~0#1 % 256 % 4294967296 else main_~var_10_arg_0~0#1 % 256 % 4294967296 - 4294967296) == (if main_~var_10_arg_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_10_arg_1~0#1 % 256 % 4294967296 else main_~var_10_arg_1~0#1 % 256 % 4294967296 - 4294967296) then 1 else 0);main_~bad_11_arg_0~0#1 := main_~var_10~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~bad_11_arg_0~0#1 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "CountingPredicate [underlying: 10#L22true, annotation: [0, 0]]") ("CountingPredicate [underlying: 6#L38-4true, annotation: [0, 0]]" "main_~state_3~0#1 := main_#t~bitwise5#1;havoc main_#t~nondet4#1;havoc main_#t~bitwise5#1;main_~init_4_arg_1~0#1 := main_~var_2~0#1;main_~state_3~0#1 := main_~init_4_arg_1~0#1;" "CountingPredicate [underlying: 2#L42-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#L22true, annotation: [0, 0]]" "assume 0 == __VERIFIER_assert_~cond#1;" "CountingPredicate [underlying: 4#L22-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#L22true, annotation: [0, 0]]" "assume !(0 == __VERIFIER_assert_~cond#1);" "CountingPredicate [underlying: 13#L22-3true, annotation: [0, 0]]") ("CountingPredicate [underlying: 5#L55-4true, annotation: [0, 0]]" "main_~var_6~0#1 := main_#t~bitwise6#1;havoc main_#t~bitwise6#1;main_~next_7_arg_1~0#1 := main_~var_6~0#1;main_~state_3~0#1 := main_~next_7_arg_1~0#1;havoc main_~var_10_arg_0~0#1, main_~var_10_arg_1~0#1, main_~var_10~0#1, main_~bad_11_arg_0~0#1, main_~var_6_arg_0~0#1, main_~var_6_arg_1~0#1, main_~var_6~0#1, main_~next_7_arg_1~0#1;" "CountingPredicate [underlying: 2#L42-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 4#L22-1true, annotation: [0, 0]]" "assume !false;" "CountingPredicate [underlying: 7#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 4#L22-1true, annotation: [0, 0]]" "assume false;assume false;" "CountingPredicate [underlying: 13#L22-3true, annotation: [0, 0]]") ("CountingPredicate [underlying: 12#$Ultimate##0true, annotation: [0, 0]]" "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~bitwise5#1, main_#t~bitwise6#1, main_~var_10_arg_0~0#1, main_~var_10_arg_1~0#1, main_~var_10~0#1, main_~bad_11_arg_0~0#1, main_~var_6_arg_0~0#1, main_~var_6_arg_1~0#1, main_~var_6~0#1, main_~next_7_arg_1~0#1, main_~mask_SORT_1~0#1, main_~msb_SORT_1~0#1, main_~mask_SORT_9~0#1, main_~msb_SORT_9~0#1, main_~var_2~0#1, main_~var_5~0#1, main_~var_8~0#1, main_~state_3~0#1, main_~init_4_arg_1~0#1;main_~mask_SORT_1~0#1 := 7;main_~msb_SORT_1~0#1 := 4;main_~mask_SORT_9~0#1 := 1;main_~msb_SORT_9~0#1 := 1;main_~var_2~0#1 := 0;main_~var_5~0#1 := 1;main_~var_8~0#1 := main_~mask_SORT_1~0#1;havoc main_#t~nondet4#1;" "CountingPredicate [underlying: 14#L38true, annotation: [0, 0]]") ("CountingPredicate [underlying: 13#L22-3true, annotation: [0, 0]]" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~var_6_arg_0~0#1 := main_~state_3~0#1;main_~var_6_arg_1~0#1 := main_~var_5~0#1;main_~var_6~0#1 := (if main_~var_6_arg_0~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6_arg_0~0#1 % 256 % 4294967296 else main_~var_6_arg_0~0#1 % 256 % 4294967296 - 4294967296) + (if main_~var_6_arg_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6_arg_1~0#1 % 256 % 4294967296 else main_~var_6_arg_1~0#1 % 256 % 4294967296 - 4294967296);" "CountingPredicate [underlying: 9#L55true, annotation: [0, 0]]") ("CountingPredicate [underlying: 11#L55-2true, annotation: [0, 0]]" "assume (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296);main_#t~bitwise6#1 := (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296);" "CountingPredicate [underlying: 5#L55-4true, annotation: [0, 0]]") ("CountingPredicate [underlying: 11#L55-2true, annotation: [0, 0]]" "assume !((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) == (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296));assume ((((((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise6#1 <= (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296)) && (((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise6#1 <= (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && (((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) < 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) < 0) || main_#t~bitwise6#1 >= 0)) && (((if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) >= 0 && (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296) >= 0) || main_#t~bitwise6#1 > (if main_~var_6~0#1 % 256 % 4294967296 <= 2147483647 then main_~var_6~0#1 % 256 % 4294967296 else main_~var_6~0#1 % 256 % 4294967296 - 4294967296) + (if main_~mask_SORT_1~0#1 % 256 % 4294967296 <= 2147483647 then main_~mask_SORT_1~0#1 % 256 % 4294967296 else main_~mask_SORT_1~0#1 % 256 % 4294967296 - 4294967296))) && main_#t~bitwise6#1 >= -2147483648;" "CountingPredicate [underlying: 5#L55-4true, annotation: [0, 0]]") } ); [2024-08-06 17:17:28,942 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-06 17:17:28,950 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 13 states to 0 states. [2024-08-06 17:17:28,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-06 17:17:28,977 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;@1c8204c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-06 17:17:28,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-06 17:17:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states. [2024-08-06 17:17:28,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-08-06 17:17:28,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-06 17:17:28,986 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-08-06 17:17:28,989 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-06 17:17:28,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 05:17:28 BoogieIcfgContainer [2024-08-06 17:17:28,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-06 17:17:28,992 INFO L158 Benchmark]: Toolchain (without parser) took 909.77ms. Allocated memory is still 172.0MB. Free memory was 144.0MB in the beginning and 105.7MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-08-06 17:17:28,992 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 172.0MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-06 17:17:28,993 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-06 17:17:28,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.59ms. Allocated memory is still 172.0MB. Free memory was 144.0MB in the beginning and 132.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-06 17:17:28,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.25ms. Allocated memory is still 172.0MB. Free memory was 132.2MB in the beginning and 130.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-06 17:17:28,997 INFO L158 Benchmark]: Boogie Preprocessor took 53.02ms. Allocated memory is still 172.0MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-06 17:17:28,998 INFO L158 Benchmark]: RCFGBuilder took 430.93ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 114.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-06 17:17:28,998 INFO L158 Benchmark]: TraceAbstraction took 128.74ms. Allocated memory is still 172.0MB. Free memory was 113.5MB in the beginning and 105.7MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-08-06 17:17:29,000 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.12ms. Allocated memory is still 172.0MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.59ms. Allocated memory is still 172.0MB. Free memory was 144.0MB in the beginning and 132.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.25ms. Allocated memory is still 172.0MB. Free memory was 132.2MB in the beginning and 130.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.02ms. Allocated memory is still 172.0MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.93ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 114.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 128.74ms. Allocated memory is still 172.0MB. Free memory was 113.5MB in the beginning and 105.7MB in the end (delta: 7.8MB). 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 - PositiveResult [Line: 22]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-08-06 17:17:29,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE