/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 07:41:34,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 07:41:34,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 07:41:35,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 07:41:35,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 07:41:35,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 07:41:35,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 07:41:35,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 07:41:35,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 07:41:35,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 07:41:35,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 07:41:35,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 07:41:35,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 07:41:35,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 07:41:35,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 07:41:35,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 07:41:35,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 07:41:35,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 07:41:35,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 07:41:35,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 07:41:35,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 07:41:35,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 07:41:35,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 07:41:35,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 07:41:35,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 07:41:35,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 07:41:35,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 07:41:35,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 07:41:35,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 07:41:35,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 07:41:35,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 07:41:35,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 07:41:35,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 07:41:35,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 07:41:35,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 07:41:35,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 07:41:35,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 07:41:35,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 07:41:35,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 07:41:35,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 07:41:35,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 07:41:35,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 07:41:35,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 07:41:35,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 07:41:35,116 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 07:41:35,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 07:41:35,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 07:41:35,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 07:41:35,118 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 07:41:35,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 07:41:35,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 07:41:35,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 07:41:35,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 07:41:35,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 07:41:35,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 07:41:35,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 07:41:35,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:41:35,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 07:41:35,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 07:41:35,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 07:41:35,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 07:41:35,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 07:41:35,121 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 07:41:35,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 07:41:35,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 07:41:35,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 07:41:35,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 07:41:35,122 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 07:41:35,122 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 07:41:35,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 07:41:35,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 07:41:35,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 07:41:35,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 07:41:35,372 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 07:41:35,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2022-01-11 07:41:35,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71849d81/f7d4f07de2084044910a7ae32e80acce/FLAG4857bd9c2 [2022-01-11 07:41:35,811 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 07:41:35,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2022-01-11 07:41:35,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71849d81/f7d4f07de2084044910a7ae32e80acce/FLAG4857bd9c2 [2022-01-11 07:41:35,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71849d81/f7d4f07de2084044910a7ae32e80acce [2022-01-11 07:41:35,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 07:41:35,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 07:41:35,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 07:41:35,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 07:41:35,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 07:41:35,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:41:35" (1/1) ... [2022-01-11 07:41:35,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15df378b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:35, skipping insertion in model container [2022-01-11 07:41:35,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:41:35" (1/1) ... [2022-01-11 07:41:35,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 07:41:35,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 07:41:36,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2022-01-11 07:41:36,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2022-01-11 07:41:36,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:41:36,131 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 07:41:36,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2022-01-11 07:41:36,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2022-01-11 07:41:36,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:41:36,174 INFO L208 MainTranslator]: Completed translation [2022-01-11 07:41:36,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36 WrapperNode [2022-01-11 07:41:36,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 07:41:36,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 07:41:36,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 07:41:36,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 07:41:36,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,244 INFO L137 Inliner]: procedures = 56, calls = 61, calls flagged for inlining = 56, calls inlined = 66, statements flattened = 711 [2022-01-11 07:41:36,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 07:41:36,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 07:41:36,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 07:41:36,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 07:41:36,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 07:41:36,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 07:41:36,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 07:41:36,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 07:41:36,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:36,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:41:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:41:36,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 07:41:36,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 07:41:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 07:41:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 07:41:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 07:41:36,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 07:41:36,418 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 07:41:36,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 07:41:36,920 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 07:41:36,932 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 07:41:36,932 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-11 07:41:36,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:41:36 BoogieIcfgContainer [2022-01-11 07:41:36,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 07:41:36,935 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 07:41:36,935 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 07:41:36,937 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 07:41:36,938 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:41:36" (1/1) ... [2022-01-11 07:41:37,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:41:37 BasicIcfg [2022-01-11 07:41:37,095 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 07:41:37,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 07:41:37,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 07:41:37,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 07:41:37,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 07:41:35" (1/4) ... [2022-01-11 07:41:37,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40497eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:41:37, skipping insertion in model container [2022-01-11 07:41:37,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:36" (2/4) ... [2022-01-11 07:41:37,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40497eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:41:37, skipping insertion in model container [2022-01-11 07:41:37,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:41:36" (3/4) ... [2022-01-11 07:41:37,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40497eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:41:37, skipping insertion in model container [2022-01-11 07:41:37,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:41:37" (4/4) ... [2022-01-11 07:41:37,102 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.cTransformedIcfg [2022-01-11 07:41:37,105 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 07:41:37,105 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 07:41:37,142 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 07:41:37,147 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 07:41:37,148 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 07:41:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 254 states have (on average 1.547244094488189) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 07:41:37,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:37,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:37,168 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 07:41:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash 384909208, now seen corresponding path program 1 times [2022-01-11 07:41:37,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:37,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778756608] [2022-01-11 07:41:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:37,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:37,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:37,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778756608] [2022-01-11 07:41:37,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778756608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:37,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:37,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:37,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241052778] [2022-01-11 07:41:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:37,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:37,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:37,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:37,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:37,399 INFO L87 Difference]: Start difference. First operand has 259 states, 254 states have (on average 1.547244094488189) internal successors, (393), 258 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:37,474 INFO L93 Difference]: Finished difference Result 477 states and 723 transitions. [2022-01-11 07:41:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-11 07:41:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:37,496 INFO L225 Difference]: With dead ends: 477 [2022-01-11 07:41:37,496 INFO L226 Difference]: Without dead ends: 248 [2022-01-11 07:41:37,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:37,506 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 143 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:37,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 589 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-01-11 07:41:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-01-11 07:41:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.4754098360655739) internal successors, (360), 247 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 360 transitions. [2022-01-11 07:41:37,558 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 360 transitions. Word has length 38 [2022-01-11 07:41:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:37,558 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 360 transitions. [2022-01-11 07:41:37,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 360 transitions. [2022-01-11 07:41:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 07:41:37,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:37,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:37,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 07:41:37,561 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 07:41:37,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1899954247, now seen corresponding path program 1 times [2022-01-11 07:41:37,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:37,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738856580] [2022-01-11 07:41:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:37,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:37,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:37,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738856580] [2022-01-11 07:41:37,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738856580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:37,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:37,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:37,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67511535] [2022-01-11 07:41:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:37,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:37,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:37,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:37,643 INFO L87 Difference]: Start difference. First operand 248 states and 360 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:37,711 INFO L93 Difference]: Finished difference Result 432 states and 621 transitions. [2022-01-11 07:41:37,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:37,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-11 07:41:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:37,713 INFO L225 Difference]: With dead ends: 432 [2022-01-11 07:41:37,713 INFO L226 Difference]: Without dead ends: 344 [2022-01-11 07:41:37,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:37,715 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 119 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:37,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 682 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-01-11 07:41:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 338. [2022-01-11 07:41:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 334 states have (on average 1.4401197604790419) internal successors, (481), 337 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 481 transitions. [2022-01-11 07:41:37,733 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 481 transitions. Word has length 38 [2022-01-11 07:41:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:37,733 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 481 transitions. [2022-01-11 07:41:37,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2022-01-11 07:41:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 07:41:37,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:37,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:37,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 07:41:37,735 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 07:41:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 362953564, now seen corresponding path program 1 times [2022-01-11 07:41:37,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627935226] [2022-01-11 07:41:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:37,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:37,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:37,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627935226] [2022-01-11 07:41:37,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627935226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:37,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:37,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:41:37,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840375020] [2022-01-11 07:41:37,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:37,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:41:37,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:37,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:41:37,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:37,805 INFO L87 Difference]: Start difference. First operand 338 states and 481 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:37,867 INFO L93 Difference]: Finished difference Result 646 states and 911 transitions. [2022-01-11 07:41:37,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:41:37,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-11 07:41:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:37,869 INFO L225 Difference]: With dead ends: 646 [2022-01-11 07:41:37,869 INFO L226 Difference]: Without dead ends: 492 [2022-01-11 07:41:37,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:41:37,871 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 416 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:37,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 1632 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-11 07:41:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 344. [2022-01-11 07:41:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 340 states have (on average 1.4264705882352942) internal successors, (485), 343 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 485 transitions. [2022-01-11 07:41:37,897 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 485 transitions. Word has length 38 [2022-01-11 07:41:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:37,897 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 485 transitions. [2022-01-11 07:41:37,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 485 transitions. [2022-01-11 07:41:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 07:41:37,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:37,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:37,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 07:41:37,899 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 07:41:37,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1675102725, now seen corresponding path program 1 times [2022-01-11 07:41:37,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:37,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899275679] [2022-01-11 07:41:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:37,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:38,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:38,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899275679] [2022-01-11 07:41:38,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899275679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:38,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:38,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:41:38,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260036305] [2022-01-11 07:41:38,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:38,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:41:38,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:38,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:41:38,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:38,017 INFO L87 Difference]: Start difference. First operand 344 states and 485 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:38,092 INFO L93 Difference]: Finished difference Result 623 states and 871 transitions. [2022-01-11 07:41:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:41:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-11 07:41:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:38,094 INFO L225 Difference]: With dead ends: 623 [2022-01-11 07:41:38,094 INFO L226 Difference]: Without dead ends: 480 [2022-01-11 07:41:38,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:41:38,104 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 360 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:38,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 1556 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-01-11 07:41:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 350. [2022-01-11 07:41:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.4132947976878614) internal successors, (489), 349 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 489 transitions. [2022-01-11 07:41:38,180 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 489 transitions. Word has length 38 [2022-01-11 07:41:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:38,180 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 489 transitions. [2022-01-11 07:41:38,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 489 transitions. [2022-01-11 07:41:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 07:41:38,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:38,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:38,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 07:41:38,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 07:41:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2109330394, now seen corresponding path program 1 times [2022-01-11 07:41:38,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:38,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885107318] [2022-01-11 07:41:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:38,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 07:41:38,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 07:41:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 07:41:38,278 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 07:41:38,278 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 07:41:38,279 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-11 07:41:38,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-11 07:41:38,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-11 07:41:38,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-11 07:41:38,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 07:41:38,283 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-01-11 07:41:38,285 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 07:41:38,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:41:38 BasicIcfg [2022-01-11 07:41:38,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 07:41:38,370 INFO L158 Benchmark]: Toolchain (without parser) took 2524.80ms. Allocated memory was 178.3MB in the beginning and 286.3MB in the end (delta: 108.0MB). Free memory was 121.4MB in the beginning and 197.0MB in the end (delta: -75.6MB). Peak memory consumption was 34.2MB. Max. memory is 8.0GB. [2022-01-11 07:41:38,370 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 07:41:38,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.80ms. Allocated memory was 178.3MB in the beginning and 286.3MB in the end (delta: 108.0MB). Free memory was 121.1MB in the beginning and 251.6MB in the end (delta: -130.5MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-01-11 07:41:38,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.61ms. Allocated memory is still 286.3MB. Free memory was 251.6MB in the beginning and 247.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 07:41:38,370 INFO L158 Benchmark]: Boogie Preprocessor took 33.55ms. Allocated memory is still 286.3MB. Free memory was 247.9MB in the beginning and 245.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 07:41:38,371 INFO L158 Benchmark]: RCFGBuilder took 654.86ms. Allocated memory is still 286.3MB. Free memory was 244.8MB in the beginning and 215.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-01-11 07:41:38,371 INFO L158 Benchmark]: IcfgTransformer took 160.25ms. Allocated memory is still 286.3MB. Free memory was 215.4MB in the beginning and 201.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-11 07:41:38,371 INFO L158 Benchmark]: TraceAbstraction took 1272.79ms. Allocated memory is still 286.3MB. Free memory was 201.3MB in the beginning and 197.0MB in the end (delta: 4.3MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. [2022-01-11 07:41:38,372 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 327.80ms. Allocated memory was 178.3MB in the beginning and 286.3MB in the end (delta: 108.0MB). Free memory was 121.1MB in the beginning and 251.6MB in the end (delta: -130.5MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.61ms. Allocated memory is still 286.3MB. Free memory was 251.6MB in the beginning and 247.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.55ms. Allocated memory is still 286.3MB. Free memory was 247.9MB in the beginning and 245.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 654.86ms. Allocated memory is still 286.3MB. Free memory was 244.8MB in the beginning and 215.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * IcfgTransformer took 160.25ms. Allocated memory is still 286.3MB. Free memory was 215.4MB in the beginning and 201.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1272.79ms. Allocated memory is still 286.3MB. Free memory was 201.3MB in the beginning and 197.0MB in the end (delta: 4.3MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. * 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: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L962] COND TRUE __VERIFIER_nondet_int() [L963] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 [L420] CALL update_channels1() [L230] COND FALSE !((int )q_req_up == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L420] RET update_channels1() [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() [L283] COND FALSE !((int )q_read_ev == 0) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L422] RET fire_delta_events1() [L423] CALL activate_threads1() [L316] int tmp ; [L317] int tmp___0 ; [L321] CALL, EXPR is_do_write_p_triggered() [L70] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L83] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L85] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() [L89] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L102] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L104] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() [L424] CALL reset_delta_events1() [L301] COND FALSE !((int )q_read_ev == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L424] RET reset_delta_events1() [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L276] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L367] CALL error1() [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 259 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1038 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1038 mSDsluCounter, 4459 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3002 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1457 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 284 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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! [2022-01-11 07:41:38,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...