/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:40:37,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:40:37,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:40:37,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:40:37,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:40:37,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:40:37,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:40:37,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:40:37,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:40:37,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:40:37,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:40:37,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:40:37,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:40:37,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:40:37,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:40:37,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:40:37,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:40:37,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:40:37,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:40:37,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:40:37,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:40:37,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:40:37,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:40:37,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:40:37,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:40:37,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:40:37,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:40:37,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:40:37,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:40:37,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:40:37,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:40:37,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:40:37,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:40:37,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:40:37,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:40:37,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:40:37,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:40:37,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:40:37,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:40:37,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:40:37,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:40:37,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:40:37,663 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:40:37,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:40:37,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:40:37,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:40:37,665 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:40:37,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:40:37,665 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:40:37,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:40:37,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:40:37,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:40:37,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:40:37,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:40:37,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:40:37,666 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:40:37,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:40:37,667 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:40:37,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:40:37,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:40:37,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:40:37,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:40:37,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:40:37,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:40:37,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:40:37,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:40:37,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:40:37,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:40:37,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:40:37,669 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:40:37,669 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:40:37,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:40:37,670 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:40:37,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:40:38,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:40:38,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:40:38,005 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:40:38,006 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:40:38,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2020-10-22 00:40:38,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c1afd3e/68cbae7ba64947ae872453ed00ca2596/FLAGc4527bd12 [2020-10-22 00:40:38,565 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:40:38,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2020-10-22 00:40:38,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c1afd3e/68cbae7ba64947ae872453ed00ca2596/FLAGc4527bd12 [2020-10-22 00:40:38,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c1afd3e/68cbae7ba64947ae872453ed00ca2596 [2020-10-22 00:40:38,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:40:38,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:40:38,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:40:38,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:40:38,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:40:38,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:40:38" (1/1) ... [2020-10-22 00:40:38,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d18121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:38, skipping insertion in model container [2020-10-22 00:40:38,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:40:38" (1/1) ... [2020-10-22 00:40:38,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:40:38,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:40:39,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:40:39,672 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:40:39,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:40:39,850 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:40:39,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39 WrapperNode [2020-10-22 00:40:39,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:40:39,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:40:39,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:40:39,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:40:39,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:40:39,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:40:39,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:40:39,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:40:39,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... [2020-10-22 00:40:39,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:40:39,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:40:39,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:40:39,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:40:39,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:40:40,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:40:40,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:40:40,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:40:40,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:40:40,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:40:40,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:40:40,060 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:40:40,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:40:40,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:40:40,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:40:40,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:40:40,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:40:40,064 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:40:41,991 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:40:41,992 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:40:41,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:40:41 BoogieIcfgContainer [2020-10-22 00:40:41,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:40:41,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:40:41,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:40:42,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:40:42,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:40:38" (1/3) ... [2020-10-22 00:40:42,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7074cd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:40:42, skipping insertion in model container [2020-10-22 00:40:42,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:39" (2/3) ... [2020-10-22 00:40:42,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7074cd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:40:42, skipping insertion in model container [2020-10-22 00:40:42,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:40:41" (3/3) ... [2020-10-22 00:40:42,004 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2020-10-22 00:40:42,016 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:40:42,016 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:40:42,024 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:40:42,025 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:40:42,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,066 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,066 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,075 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,077 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:42,078 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:40:42,093 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-22 00:40:42,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:40:42,114 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:40:42,115 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:40:42,115 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:40:42,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:40:42,115 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:40:42,115 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:40:42,115 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:40:42,129 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:40:42,130 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-22 00:40:42,132 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-22 00:40:42,134 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-10-22 00:40:42,178 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-22 00:40:42,178 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:40:42,183 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-22 00:40:42,186 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-10-22 00:40:42,505 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 00:40:43,017 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-22 00:40:44,707 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-22 00:40:44,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 00:40:44,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:44,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 00:40:44,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:45,707 WARN L193 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2020-10-22 00:40:47,181 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-10-22 00:40:47,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-22 00:40:47,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:47,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 00:40:47,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:48,421 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 141 DAG size of output: 104 [2020-10-22 00:40:49,107 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-22 00:40:49,540 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-22 00:40:49,662 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-22 00:40:50,092 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-22 00:40:50,378 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-22 00:40:50,833 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-22 00:40:51,103 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-22 00:40:51,450 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-10-22 00:40:51,620 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-22 00:40:51,626 INFO L131 LiptonReduction]: Checked pairs total: 2421 [2020-10-22 00:40:51,626 INFO L133 LiptonReduction]: Total number of compositions: 77 [2020-10-22 00:40:51,639 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-22 00:40:51,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-22 00:40:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-22 00:40:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 00:40:51,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:51,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 00:40:51,669 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash 907060207, now seen corresponding path program 1 times [2020-10-22 00:40:51,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:51,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005179646] [2020-10-22 00:40:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:51,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005179646] [2020-10-22 00:40:51,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:51,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:40:51,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072878950] [2020-10-22 00:40:51,930 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:51,933 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:51,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 00:40:51,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:51,950 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:51,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:51,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:51,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:51,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:51,968 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-22 00:40:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:52,038 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-22 00:40:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:52,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 00:40:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:52,052 INFO L225 Difference]: With dead ends: 137 [2020-10-22 00:40:52,052 INFO L226 Difference]: Without dead ends: 112 [2020-10-22 00:40:52,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-22 00:40:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-22 00:40:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-22 00:40:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-22 00:40:52,105 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-22 00:40:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:52,106 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-22 00:40:52,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-22 00:40:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:40:52,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:52,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:52,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:40:52,108 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:52,108 INFO L82 PathProgramCache]: Analyzing trace with hash -193428177, now seen corresponding path program 1 times [2020-10-22 00:40:52,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:52,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306407634] [2020-10-22 00:40:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:52,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306407634] [2020-10-22 00:40:52,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:52,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:40:52,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332228199] [2020-10-22 00:40:52,334 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:52,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:52,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:40:52,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:52,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:52,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:40:52,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:40:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:40:52,341 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-10-22 00:40:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:52,394 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-22 00:40:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:52,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-22 00:40:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:52,402 INFO L225 Difference]: With dead ends: 111 [2020-10-22 00:40:52,402 INFO L226 Difference]: Without dead ends: 111 [2020-10-22 00:40:52,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:40:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-22 00:40:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-22 00:40:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-22 00:40:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-22 00:40:52,429 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-22 00:40:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:52,430 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-22 00:40:52,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:40:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-22 00:40:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:40:52,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:52,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:52,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:40:52,431 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:52,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:52,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2141230383, now seen corresponding path program 1 times [2020-10-22 00:40:52,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:52,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192619348] [2020-10-22 00:40:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:52,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192619348] [2020-10-22 00:40:52,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:52,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:40:52,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159486518] [2020-10-22 00:40:52,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:52,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:52,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 16 transitions. [2020-10-22 00:40:52,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:52,660 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:52,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:52,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:52,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:52,662 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 3 states. [2020-10-22 00:40:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:52,707 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-22 00:40:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:52,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-22 00:40:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:52,710 INFO L225 Difference]: With dead ends: 107 [2020-10-22 00:40:52,710 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 00:40:52,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 00:40:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-22 00:40:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 00:40:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-22 00:40:52,729 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-10-22 00:40:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:52,730 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-22 00:40:52,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-22 00:40:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:40:52,731 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:52,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:52,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:40:52,731 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1701307072, now seen corresponding path program 1 times [2020-10-22 00:40:52,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:52,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660117960] [2020-10-22 00:40:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:52,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660117960] [2020-10-22 00:40:52,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:52,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:40:52,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1366834751] [2020-10-22 00:40:52,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:52,846 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:52,847 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-22 00:40:52,847 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:52,848 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:52,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:52,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:52,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:52,851 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 3 states. [2020-10-22 00:40:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:52,863 INFO L93 Difference]: Finished difference Result 106 states and 238 transitions. [2020-10-22 00:40:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:52,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-22 00:40:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:52,865 INFO L225 Difference]: With dead ends: 106 [2020-10-22 00:40:52,865 INFO L226 Difference]: Without dead ends: 106 [2020-10-22 00:40:52,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-22 00:40:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-22 00:40:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-22 00:40:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-10-22 00:40:52,873 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-10-22 00:40:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:52,873 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-10-22 00:40:52,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-10-22 00:40:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:40:52,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:52,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:52,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:40:52,875 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1953631552, now seen corresponding path program 1 times [2020-10-22 00:40:52,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:52,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852041634] [2020-10-22 00:40:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:53,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852041634] [2020-10-22 00:40:53,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:53,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:40:53,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411360056] [2020-10-22 00:40:53,020 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:53,022 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:53,025 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-10-22 00:40:53,025 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:53,240 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:53,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:40:53,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:40:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:40:53,243 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-10-22 00:40:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:53,314 INFO L93 Difference]: Finished difference Result 103 states and 229 transitions. [2020-10-22 00:40:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:40:53,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 00:40:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:53,315 INFO L225 Difference]: With dead ends: 103 [2020-10-22 00:40:53,315 INFO L226 Difference]: Without dead ends: 103 [2020-10-22 00:40:53,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:40:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-22 00:40:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-22 00:40:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-22 00:40:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-10-22 00:40:53,323 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-10-22 00:40:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:53,323 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-10-22 00:40:53,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:40:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-10-22 00:40:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:40:53,324 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:53,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:53,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:40:53,325 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash 433034188, now seen corresponding path program 1 times [2020-10-22 00:40:53,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:53,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225318622] [2020-10-22 00:40:53,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:53,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225318622] [2020-10-22 00:40:53,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:53,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:40:53,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720058376] [2020-10-22 00:40:53,406 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:53,408 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:53,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 00:40:53,411 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:53,559 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2079#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-10-22 00:40:53,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:40:53,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:53,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:40:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:53,561 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 6 states. [2020-10-22 00:40:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:53,636 INFO L93 Difference]: Finished difference Result 109 states and 239 transitions. [2020-10-22 00:40:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:40:53,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-22 00:40:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:53,641 INFO L225 Difference]: With dead ends: 109 [2020-10-22 00:40:53,641 INFO L226 Difference]: Without dead ends: 109 [2020-10-22 00:40:53,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-22 00:40:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-10-22 00:40:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 00:40:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 236 transitions. [2020-10-22 00:40:53,650 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 236 transitions. Word has length 10 [2020-10-22 00:40:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:53,651 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 236 transitions. [2020-10-22 00:40:53,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:40:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 236 transitions. [2020-10-22 00:40:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:40:53,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:53,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:53,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:40:53,653 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1426394591, now seen corresponding path program 1 times [2020-10-22 00:40:53,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:53,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78188618] [2020-10-22 00:40:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:53,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78188618] [2020-10-22 00:40:53,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:53,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:40:53,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744252034] [2020-10-22 00:40:53,755 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:53,756 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:53,758 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:40:53,759 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:53,759 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:53,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:40:53,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:53,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:40:53,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:40:53,760 INFO L87 Difference]: Start difference. First operand 107 states and 236 transitions. Second operand 5 states. [2020-10-22 00:40:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:53,830 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-10-22 00:40:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:40:53,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-22 00:40:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:53,832 INFO L225 Difference]: With dead ends: 153 [2020-10-22 00:40:53,832 INFO L226 Difference]: Without dead ends: 111 [2020-10-22 00:40:53,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-22 00:40:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2020-10-22 00:40:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-22 00:40:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-22 00:40:53,838 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-22 00:40:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:53,839 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-22 00:40:53,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:40:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-22 00:40:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:40:53,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:53,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:53,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:40:53,841 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 539156191, now seen corresponding path program 1 times [2020-10-22 00:40:53,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:53,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168128015] [2020-10-22 00:40:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:53,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168128015] [2020-10-22 00:40:53,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:53,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:40:53,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1452073541] [2020-10-22 00:40:53,962 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:53,964 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:53,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-22 00:40:53,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:54,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2779#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0))] [2020-10-22 00:40:54,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:40:54,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:40:54,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:40:54,130 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 7 states. [2020-10-22 00:40:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:54,286 INFO L93 Difference]: Finished difference Result 119 states and 236 transitions. [2020-10-22 00:40:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:40:54,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-22 00:40:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:54,287 INFO L225 Difference]: With dead ends: 119 [2020-10-22 00:40:54,287 INFO L226 Difference]: Without dead ends: 69 [2020-10-22 00:40:54,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:40:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-22 00:40:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-10-22 00:40:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-22 00:40:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-10-22 00:40:54,292 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-10-22 00:40:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:54,293 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-10-22 00:40:54,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:40:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-10-22 00:40:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:40:54,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:54,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:54,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:40:54,294 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:54,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1268585729, now seen corresponding path program 1 times [2020-10-22 00:40:54,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:54,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028807545] [2020-10-22 00:40:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:54,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028807545] [2020-10-22 00:40:54,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:54,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:40:54,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [496527073] [2020-10-22 00:40:54,389 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:54,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:54,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-22 00:40:54,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:54,398 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:54,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:40:54,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:54,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:40:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:40:54,399 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand 4 states. [2020-10-22 00:40:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:54,452 INFO L93 Difference]: Finished difference Result 78 states and 141 transitions. [2020-10-22 00:40:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:40:54,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:40:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:54,454 INFO L225 Difference]: With dead ends: 78 [2020-10-22 00:40:54,454 INFO L226 Difference]: Without dead ends: 61 [2020-10-22 00:40:54,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:40:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-22 00:40:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-22 00:40:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-22 00:40:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 118 transitions. [2020-10-22 00:40:54,457 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 118 transitions. Word has length 11 [2020-10-22 00:40:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:54,458 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 118 transitions. [2020-10-22 00:40:54,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:40:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 118 transitions. [2020-10-22 00:40:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:40:54,459 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:54,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:54,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:40:54,459 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1626460929, now seen corresponding path program 2 times [2020-10-22 00:40:54,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:54,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156190584] [2020-10-22 00:40:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:54,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156190584] [2020-10-22 00:40:54,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:54,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:40:54,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482808281] [2020-10-22 00:40:54,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:54,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:54,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-10-22 00:40:54,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:54,749 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3240#(and (= 0 ~x$r_buff0_thd0~0) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 ULTIMATE.start_assume_abort_if_not_~cond))] [2020-10-22 00:40:54,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:40:54,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:54,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:40:54,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:54,750 INFO L87 Difference]: Start difference. First operand 61 states and 118 transitions. Second operand 6 states. [2020-10-22 00:40:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:54,880 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2020-10-22 00:40:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:40:54,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-22 00:40:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:54,882 INFO L225 Difference]: With dead ends: 56 [2020-10-22 00:40:54,882 INFO L226 Difference]: Without dead ends: 40 [2020-10-22 00:40:54,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:40:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-22 00:40:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-10-22 00:40:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-22 00:40:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-10-22 00:40:54,885 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 11 [2020-10-22 00:40:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:54,885 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-22 00:40:54,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:40:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-10-22 00:40:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:40:54,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:54,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:54,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:40:54,886 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:54,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1119968960, now seen corresponding path program 1 times [2020-10-22 00:40:54,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:54,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140223550] [2020-10-22 00:40:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:54,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140223550] [2020-10-22 00:40:54,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:54,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:40:54,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1519827760] [2020-10-22 00:40:54,988 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:54,989 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:54,994 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-10-22 00:40:54,995 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:55,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:55,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:40:55,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:40:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:40:55,066 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 5 states. [2020-10-22 00:40:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:55,118 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-10-22 00:40:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:40:55,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 00:40:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:55,120 INFO L225 Difference]: With dead ends: 31 [2020-10-22 00:40:55,120 INFO L226 Difference]: Without dead ends: 20 [2020-10-22 00:40:55,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-22 00:40:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-22 00:40:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-22 00:40:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-22 00:40:55,122 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-10-22 00:40:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:55,122 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-22 00:40:55,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:40:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-22 00:40:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:40:55,124 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:55,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:55,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:40:55,125 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1283443941, now seen corresponding path program 1 times [2020-10-22 00:40:55,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:55,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672425656] [2020-10-22 00:40:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:40:55,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:40:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:40:55,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:40:55,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:40:55,348 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:40:55,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:40:55,349 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:40:55,360 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse6 (= 0 (mod ~x$w_buff0_used~0_In1174898135 256))) (.cse7 (= (mod ~x$r_buff0_thd0~0_In1174898135 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In1174898135 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In1174898135 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out1174898135 ~x$r_buff1_thd0~0_In1174898135) (or (and (= ~x$w_buff0_used~0_Out1174898135 ~x$w_buff0_used~0_In1174898135) .cse0) (and .cse1 (= ~x$w_buff0_used~0_Out1174898135 0) .cse2)) (or (and .cse3 (= ~x$w_buff1_used~0_Out1174898135 0) .cse4) (and (= ~x$w_buff1_used~0_In1174898135 ~x$w_buff1_used~0_Out1174898135) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1174898135 0)) (or (and (or (and .cse3 .cse4 (= ~x$w_buff1~0_In1174898135 ~x~0_Out1174898135)) (and .cse5 (= ~x~0_In1174898135 ~x~0_Out1174898135))) .cse0) (and .cse1 (= ~x$w_buff0~0_In1174898135 ~x~0_Out1174898135) .cse2)) (= ~x$r_buff0_thd0~0_In1174898135 ~x$r_buff0_thd0~0_Out1174898135)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1174898135, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1174898135, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1174898135, ~x$w_buff1~0=~x$w_buff1~0_In1174898135, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1174898135, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1174898135, ~x~0=~x~0_In1174898135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174898135} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1174898135, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1174898135, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1174898135|, ~x$w_buff1~0=~x$w_buff1~0_In1174898135, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1174898135|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1174898135, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1174898135, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1174898135|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1174898135|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1174898135|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1174898135, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1174898135|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1174898135, ~x~0=~x~0_Out1174898135} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-22 00:40:55,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,367 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-10-22 00:40:55,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:40:55,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:40:55,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:40:55 BasicIcfg [2020-10-22 00:40:55,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:40:55,478 INFO L168 Benchmark]: Toolchain (without parser) took 16557.46 ms. Allocated memory was 145.8 MB in the beginning and 359.7 MB in the end (delta: 213.9 MB). Free memory was 100.6 MB in the beginning and 180.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 134.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:40:55,479 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:40:55,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 924.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 154.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:40:55,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.04 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 151.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:40:55,485 INFO L168 Benchmark]: Boogie Preprocessor took 60.57 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:40:55,486 INFO L168 Benchmark]: RCFGBuilder took 2012.00 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 149.2 MB in the beginning and 195.5 MB in the end (delta: -46.3 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:40:55,493 INFO L168 Benchmark]: TraceAbstraction took 13479.72 ms. Allocated memory was 249.0 MB in the beginning and 359.7 MB in the end (delta: 110.6 MB). Free memory was 195.5 MB in the beginning and 180.0 MB in the end (delta: 15.5 MB). Peak memory consumption was 126.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:40:55,501 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 924.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 154.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.04 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 151.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.57 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2012.00 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 149.2 MB in the beginning and 195.5 MB in the end (delta: -46.3 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13479.72 ms. Allocated memory was 249.0 MB in the beginning and 359.7 MB in the end (delta: 110.6 MB). Free memory was 195.5 MB in the beginning and 180.0 MB in the end (delta: 15.5 MB). Peak memory consumption was 126.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 566 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.4s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 77 TotalNumberOfCompositions, 2421 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2479; [L791] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2480; [L793] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 153 SDtfs, 130 SDslu, 167 SDs, 0 SdLazy, 221 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, 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, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 6830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! Received shutdown request...