/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:26:47,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:26:47,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:26:47,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:26:47,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:26:47,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:26:47,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:26:47,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:26:47,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:26:47,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:26:47,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:26:47,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:26:47,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:26:47,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:26:47,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:26:47,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:26:47,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:26:47,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:26:47,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:26:47,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:26:47,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:26:47,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:26:47,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:26:47,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:26:47,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:26:47,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:26:47,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:26:47,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:26:47,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:26:47,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:26:47,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:26:47,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:26:47,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:26:47,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:26:48,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:26:48,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:26:48,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:26:48,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:26:48,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:26:48,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:26:48,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:26:48,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:26:48,053 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:26:48,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:26:48,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:26:48,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:26:48,058 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:26:48,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:26:48,058 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:26:48,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:26:48,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:26:48,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:26:48,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:26:48,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:26:48,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:26:48,060 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:26:48,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:26:48,060 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:26:48,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:26:48,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:26:48,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:26:48,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:26:48,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:26:48,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:26:48,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:26:48,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:26:48,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:26:48,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:26:48,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:26:48,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:26:48,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:26:48,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:26:48,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:26:48,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:26:48,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:26:48,359 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:26:48,359 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:26:48,360 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-11 15:26:48,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf4edefc/95d7affbdc9043dca4fa2af000daa939/FLAGe616648ba [2020-10-11 15:26:48,947 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:26:48,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-11 15:26:48,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf4edefc/95d7affbdc9043dca4fa2af000daa939/FLAGe616648ba [2020-10-11 15:26:49,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf4edefc/95d7affbdc9043dca4fa2af000daa939 [2020-10-11 15:26:49,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:26:49,185 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:26:49,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:26:49,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:26:49,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:26:49,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:49" (1/1) ... [2020-10-11 15:26:49,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f3e7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:49, skipping insertion in model container [2020-10-11 15:26:49,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:49" (1/1) ... [2020-10-11 15:26:49,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:26:49,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:26:49,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:26:50,001 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:26:50,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:26:50,514 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:26:50,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50 WrapperNode [2020-10-11 15:26:50,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:26:50,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:26:50,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:26:50,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:26:50,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:26:50,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:26:50,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:26:50,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:26:50,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (1/1) ... [2020-10-11 15:26:50,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:26:50,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:26:50,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:26:50,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:26:50,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (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-11 15:26:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:26:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 15:26:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-11 15:26:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:26:50,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:26:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-11 15:26:50,748 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-11 15:26:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:26:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:26:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-11 15:26:50,751 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:26:51,536 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:26:51,536 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-11 15:26:51,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:51 BoogieIcfgContainer [2020-10-11 15:26:51,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:26:51,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:26:51,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:26:51,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:26:51,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:26:49" (1/3) ... [2020-10-11 15:26:51,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a66defb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:51, skipping insertion in model container [2020-10-11 15:26:51,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:50" (2/3) ... [2020-10-11 15:26:51,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a66defb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:51, skipping insertion in model container [2020-10-11 15:26:51,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:51" (3/3) ... [2020-10-11 15:26:51,547 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-11 15:26:51,559 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:26:51,559 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:26:51,567 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-11 15:26:51,568 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:26:51,599 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,599 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,600 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,600 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,600 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,600 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,603 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,603 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,603 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,606 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,606 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,606 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,606 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,607 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,607 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,607 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,607 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,607 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,608 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,608 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,608 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,608 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,609 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,609 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,612 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,613 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,613 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,613 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,613 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,613 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,614 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,614 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,614 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,620 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,620 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,621 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:26:51,649 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-11 15:26:51,676 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:26:51,676 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:26:51,676 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:26:51,676 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:26:51,676 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:26:51,677 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:26:51,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:26:51,677 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:26:51,700 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:26:51,702 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-11 15:26:51,705 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-11 15:26:51,707 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-11 15:26:51,781 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-11 15:26:51,782 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-11 15:26:51,789 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-10-11 15:26:51,796 INFO L117 LiptonReduction]: Number of co-enabled transitions 1980 [2020-10-11 15:26:52,086 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:52,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:52,124 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:52,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:52,146 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:52,146 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:52,162 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:52,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:52,191 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:52,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:52,213 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:52,214 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:54,857 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:54,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:54,877 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:54,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:54,892 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:54,892 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-11 15:26:55,305 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:55,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,343 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:55,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,371 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:55,372 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:55,386 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:55,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,425 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:55,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:55,452 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:55,453 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:57,490 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:57,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,522 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:57,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,556 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:57,557 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:57,567 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:57,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,594 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:57,619 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:57,620 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:57,621 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:59,682 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:59,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,711 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:59,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:59,738 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:59,754 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:59,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,782 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:59,807 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:59,808 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:59,809 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:27:02,512 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:02,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,536 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:02,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,560 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:02,561 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-11 15:27:02,575 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:02,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,611 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:02,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:02,631 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:02,632 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:27:03,047 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:03,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:03,066 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:03,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:03,078 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:03,078 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-11 15:27:04,042 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,067 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,084 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-11 15:27:04,120 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,194 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,239 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,239 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-10-11 15:27:04,252 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,301 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:04,337 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:04,337 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2020-10-11 15:27:06,352 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:06,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,388 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:06,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,416 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:06,416 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-11 15:27:06,427 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:06,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,456 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:06,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:06,479 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:06,479 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:27:08,713 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:08,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:08,746 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:08,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:08,769 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:08,769 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-11 15:27:08,782 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:08,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:08,815 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:08,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:08,845 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:08,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:27:11,379 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-10-11 15:27:11,504 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-11 15:27:11,761 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-10-11 15:27:12,433 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-10-11 15:27:12,635 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-11 15:27:13,275 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-11 15:27:13,498 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-11 15:27:14,632 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-11 15:27:14,650 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:15,182 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-11 15:27:15,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:15,190 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:15,675 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-11 15:27:15,676 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:27:15,677 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-11 15:27:15,678 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-11 15:27:16,168 WARN L193 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-11 15:27:16,177 INFO L132 LiptonReduction]: Checked pairs total: 4147 [2020-10-11 15:27:16,177 INFO L134 LiptonReduction]: Total number of compositions: 165 [2020-10-11 15:27:16,183 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-10-11 15:27:16,205 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-10-11 15:27:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-10-11 15:27:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-11 15:27:16,213 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:16,214 INFO L421 BasicCegarLoop]: trace histogram [1] [2020-10-11 15:27:16,214 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:16,218 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-10-11 15:27:16,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:16,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321016451] [2020-10-11 15:27:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:16,445 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-11 15:27:16,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321016451] [2020-10-11 15:27:16,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:16,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-11 15:27:16,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892521743] [2020-10-11 15:27:16,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-11 15:27:16,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:16,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-11 15:27:16,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-11 15:27:16,504 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-10-11 15:27:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:16,547 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-10-11 15:27:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-11 15:27:16,549 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-11 15:27:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:16,570 INFO L225 Difference]: With dead ends: 190 [2020-10-11 15:27:16,570 INFO L226 Difference]: Without dead ends: 172 [2020-10-11 15:27:16,572 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-11 15:27:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-11 15:27:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-10-11 15:27:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-11 15:27:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-10-11 15:27:16,632 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-10-11 15:27:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:16,632 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-10-11 15:27:16,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-11 15:27:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-10-11 15:27:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-11 15:27:16,633 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:16,633 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-11 15:27:16,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:27:16,633 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:16,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-10-11 15:27:16,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:16,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315789018] [2020-10-11 15:27:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:16,841 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-11 15:27:16,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315789018] [2020-10-11 15:27:16,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:16,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:27:16,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638677281] [2020-10-11 15:27:16,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:27:16,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:27:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:16,844 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-10-11 15:27:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:16,948 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-10-11 15:27:16,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:27:16,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-11 15:27:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:16,952 INFO L225 Difference]: With dead ends: 230 [2020-10-11 15:27:16,952 INFO L226 Difference]: Without dead ends: 230 [2020-10-11 15:27:16,953 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-11 15:27:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-11 15:27:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-11 15:27:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-11 15:27:16,973 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-11 15:27:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:16,973 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-11 15:27:16,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:27:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-11 15:27:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-11 15:27:16,974 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:16,974 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-11 15:27:16,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:27:16,975 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-10-11 15:27:16,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:16,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729095389] [2020-10-11 15:27:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:17,044 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-11 15:27:17,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729095389] [2020-10-11 15:27:17,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:17,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:27:17,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746603152] [2020-10-11 15:27:17,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:27:17,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:17,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:27:17,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:17,046 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-11 15:27:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:17,117 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-11 15:27:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:27:17,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-11 15:27:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:17,120 INFO L225 Difference]: With dead ends: 243 [2020-10-11 15:27:17,120 INFO L226 Difference]: Without dead ends: 236 [2020-10-11 15:27:17,120 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 15:27:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-11 15:27:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-11 15:27:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-11 15:27:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-11 15:27:17,136 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-11 15:27:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:17,136 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-11 15:27:17,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:27:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-11 15:27:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:27:17,140 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:17,140 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:17,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:27:17,140 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-10-11 15:27:17,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:17,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660951280] [2020-10-11 15:27:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:17,254 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-11 15:27:17,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660951280] [2020-10-11 15:27:17,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:17,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:27:17,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725854759] [2020-10-11 15:27:17,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:27:17,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:27:17,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:17,256 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-11 15:27:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:17,277 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-11 15:27:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:27:17,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-11 15:27:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:17,279 INFO L225 Difference]: With dead ends: 86 [2020-10-11 15:27:17,279 INFO L226 Difference]: Without dead ends: 86 [2020-10-11 15:27:17,279 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:27:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-11 15:27:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-11 15:27:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-11 15:27:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-11 15:27:17,292 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-11 15:27:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:17,293 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-11 15:27:17,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:27:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-11 15:27:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:17,297 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:17,297 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:17,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:27:17,298 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-10-11 15:27:17,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:17,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331250656] [2020-10-11 15:27:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:17,584 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-11 15:27:17,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331250656] [2020-10-11 15:27:17,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:17,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:27:17,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106100976] [2020-10-11 15:27:17,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:27:17,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:17,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:27:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:27:17,588 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-10-11 15:27:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:17,887 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-10-11 15:27:17,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:27:17,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-11 15:27:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:17,889 INFO L225 Difference]: With dead ends: 145 [2020-10-11 15:27:17,889 INFO L226 Difference]: Without dead ends: 145 [2020-10-11 15:27:17,889 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:27:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-11 15:27:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-10-11 15:27:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-11 15:27:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-10-11 15:27:17,904 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-10-11 15:27:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:17,904 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-10-11 15:27:17,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:27:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-10-11 15:27:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:17,909 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:17,909 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:17,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:27:17,910 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-10-11 15:27:17,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:17,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018475687] [2020-10-11 15:27:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:18,528 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-11 15:27:18,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018475687] [2020-10-11 15:27:18,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:18,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:18,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855853611] [2020-10-11 15:27:18,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:18,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:18,530 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-10-11 15:27:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:19,300 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-10-11 15:27:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:19,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-11 15:27:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:19,303 INFO L225 Difference]: With dead ends: 157 [2020-10-11 15:27:19,303 INFO L226 Difference]: Without dead ends: 136 [2020-10-11 15:27:19,304 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-11 15:27:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-11 15:27:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-10-11 15:27:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-11 15:27:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-10-11 15:27:19,309 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-10-11 15:27:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:19,309 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-10-11 15:27:19,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-10-11 15:27:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:19,311 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:19,311 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:19,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:27:19,311 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:19,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:19,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-10-11 15:27:19,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:19,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129213481] [2020-10-11 15:27:19,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:19,486 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-11 15:27:19,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129213481] [2020-10-11 15:27:19,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:19,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:27:19,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352610914] [2020-10-11 15:27:19,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:27:19,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:19,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:27:19,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:27:19,488 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 7 states. [2020-10-11 15:27:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:19,809 INFO L93 Difference]: Finished difference Result 158 states and 276 transitions. [2020-10-11 15:27:19,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:27:19,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-11 15:27:19,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:19,812 INFO L225 Difference]: With dead ends: 158 [2020-10-11 15:27:19,812 INFO L226 Difference]: Without dead ends: 158 [2020-10-11 15:27:19,812 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:27:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-11 15:27:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2020-10-11 15:27:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-11 15:27:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 200 transitions. [2020-10-11 15:27:19,821 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 200 transitions. Word has length 18 [2020-10-11 15:27:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:19,822 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 200 transitions. [2020-10-11 15:27:19,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:27:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 200 transitions. [2020-10-11 15:27:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:19,824 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:19,824 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:19,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:27:19,824 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:19,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-10-11 15:27:19,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:19,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324038378] [2020-10-11 15:27:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:20,366 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-11 15:27:20,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324038378] [2020-10-11 15:27:20,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:20,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:20,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606132507] [2020-10-11 15:27:20,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:20,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:20,368 INFO L87 Difference]: Start difference. First operand 109 states and 200 transitions. Second operand 12 states. [2020-10-11 15:27:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:21,085 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2020-10-11 15:27:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:27:21,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-11 15:27:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:21,087 INFO L225 Difference]: With dead ends: 137 [2020-10-11 15:27:21,087 INFO L226 Difference]: Without dead ends: 126 [2020-10-11 15:27:21,088 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-11 15:27:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-11 15:27:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-10-11 15:27:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-11 15:27:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 196 transitions. [2020-10-11 15:27:21,093 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 196 transitions. Word has length 18 [2020-10-11 15:27:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:21,093 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 196 transitions. [2020-10-11 15:27:21,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 196 transitions. [2020-10-11 15:27:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:21,095 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:21,095 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:21,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:27:21,095 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:21,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-10-11 15:27:21,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:21,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719569044] [2020-10-11 15:27:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:21,589 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-11 15:27:21,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719569044] [2020-10-11 15:27:21,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:21,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:21,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232015998] [2020-10-11 15:27:21,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:21,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:21,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:21,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:21,592 INFO L87 Difference]: Start difference. First operand 107 states and 196 transitions. Second operand 12 states. [2020-10-11 15:27:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:22,284 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2020-10-11 15:27:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:22,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-11 15:27:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:22,285 INFO L225 Difference]: With dead ends: 139 [2020-10-11 15:27:22,285 INFO L226 Difference]: Without dead ends: 124 [2020-10-11 15:27:22,286 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-11 15:27:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-11 15:27:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-10-11 15:27:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-11 15:27:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 192 transitions. [2020-10-11 15:27:22,291 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 192 transitions. Word has length 18 [2020-10-11 15:27:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:22,291 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 192 transitions. [2020-10-11 15:27:22,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 192 transitions. [2020-10-11 15:27:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:22,292 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:22,292 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:22,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:27:22,292 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1672062081, now seen corresponding path program 4 times [2020-10-11 15:27:22,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:22,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205177145] [2020-10-11 15:27:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:22,720 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-11 15:27:22,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205177145] [2020-10-11 15:27:22,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:22,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:27:22,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063455369] [2020-10-11 15:27:22,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:27:22,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:27:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:27:22,723 INFO L87 Difference]: Start difference. First operand 105 states and 192 transitions. Second operand 12 states. [2020-10-11 15:27:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:23,481 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-10-11 15:27:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:23,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-11 15:27:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:23,483 INFO L225 Difference]: With dead ends: 136 [2020-10-11 15:27:23,483 INFO L226 Difference]: Without dead ends: 113 [2020-10-11 15:27:23,483 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-11 15:27:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-11 15:27:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-10-11 15:27:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-11 15:27:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2020-10-11 15:27:23,487 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2020-10-11 15:27:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:23,487 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2020-10-11 15:27:23,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:27:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2020-10-11 15:27:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:23,488 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:23,488 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:23,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:27:23,489 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-10-11 15:27:23,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:23,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102843220] [2020-10-11 15:27:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:23,867 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-11 15:27:23,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102843220] [2020-10-11 15:27:23,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:23,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:27:23,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138529378] [2020-10-11 15:27:23,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:27:23,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:27:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:27:23,869 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2020-10-11 15:27:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:24,439 INFO L93 Difference]: Finished difference Result 153 states and 270 transitions. [2020-10-11 15:27:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:24,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-11 15:27:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:24,441 INFO L225 Difference]: With dead ends: 153 [2020-10-11 15:27:24,441 INFO L226 Difference]: Without dead ends: 132 [2020-10-11 15:27:24,442 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:27:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-11 15:27:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2020-10-11 15:27:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-11 15:27:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2020-10-11 15:27:24,446 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 18 [2020-10-11 15:27:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:24,446 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2020-10-11 15:27:24,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:27:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2020-10-11 15:27:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:24,447 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:24,447 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:24,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 15:27:24,448 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 3 times [2020-10-11 15:27:24,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:24,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042941387] [2020-10-11 15:27:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:24,625 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-11 15:27:24,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042941387] [2020-10-11 15:27:24,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:24,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:27:24,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055543711] [2020-10-11 15:27:24,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:27:24,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:24,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:27:24,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:27:24,628 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 9 states. [2020-10-11 15:27:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:25,106 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2020-10-11 15:27:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 15:27:25,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-11 15:27:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:25,108 INFO L225 Difference]: With dead ends: 229 [2020-10-11 15:27:25,109 INFO L226 Difference]: Without dead ends: 229 [2020-10-11 15:27:25,109 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:27:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-11 15:27:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 123. [2020-10-11 15:27:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-11 15:27:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 223 transitions. [2020-10-11 15:27:25,115 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 223 transitions. Word has length 18 [2020-10-11 15:27:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:25,115 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 223 transitions. [2020-10-11 15:27:25,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:27:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 223 transitions. [2020-10-11 15:27:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:27:25,116 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:25,116 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:27:25,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:27:25,117 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:27:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:25,117 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-10-11 15:27:25,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:25,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766990300] [2020-10-11 15:27:25,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:27:25,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:27:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:27:25,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:27:25,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:27:25,204 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:27:25,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:27:25,204 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 15:27:25,204 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 15:27:25,205 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 15:27:25,210 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse0 (select |#memory_int_In1424964617| ULTIMATE.start_my_drv_probe_~data.base_In1424964617))) (and (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In1424964617 28)) |ULTIMATE.start_my_drv_probe_#t~mem32_Out1424964617|) (= ULTIMATE.start_ldv_assert_~expression_Out1424964617 1) (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In1424964617 24)) 0) (let ((.cse1 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out1424964617| 0))) (or (and .cse1 (= |ULTIMATE.start_ldv_assert_#in~expression_Out1424964617| 1)) (and (not .cse1) (= |ULTIMATE.start_ldv_assert_#in~expression_Out1424964617| 0)))))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In1424964617, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In1424964617, #memory_int=|#memory_int_In1424964617|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out1424964617|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out1424964617|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In1424964617, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In1424964617, #memory_int=|#memory_int_In1424964617|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1424964617|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1424964617} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-11 15:27:25,210 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out-415297540 |ULTIMATE.start_ldv_assert_#in~expression_In-415297540|) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In-415297540| 2147483647) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In-415297540| 2147483648)) (not (= ULTIMATE.start_ldv_assert_~expression_Out-415297540 0))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-415297540|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-415297540|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-415297540|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-415297540|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-415297540|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-415297540} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-11 15:27:25,216 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In208741931| |ULTIMATE.start_main_~#data~1.base_In208741931|))) (and (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In208741931| 24)) 1) (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In208741931| 28)) |ULTIMATE.start_main_#t~mem43_Out208741931|) (let ((.cse1 (= 2 |ULTIMATE.start_main_#t~mem43_Out208741931|))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out208741931| 0) (not .cse1)) (and .cse1 (= |ULTIMATE.start_ldv_assert_#in~expression_Out208741931| 1)))) (= ULTIMATE.start_ldv_assert_~expression_Out208741931 1))) InVars {#memory_int=|#memory_int_In208741931|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In208741931|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In208741931|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out208741931|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out208741931|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out208741931|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out208741931|, #memory_int=|#memory_int_In208741931|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In208741931|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out208741931|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In208741931|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out208741931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-11 15:27:25,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:27:25 BasicIcfg [2020-10-11 15:27:25,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:27:25,267 INFO L168 Benchmark]: Toolchain (without parser) took 36082.83 ms. Allocated memory was 254.3 MB in the beginning and 540.5 MB in the end (delta: 286.3 MB). Free memory was 207.5 MB in the beginning and 283.6 MB in the end (delta: -76.0 MB). Peak memory consumption was 210.2 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:25,268 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:27:25,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1330.64 ms. Allocated memory was 254.3 MB in the beginning and 367.5 MB in the end (delta: 113.2 MB). Free memory was 207.5 MB in the beginning and 333.7 MB in the end (delta: -126.2 MB). Peak memory consumption was 110.7 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:25,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.24 ms. Allocated memory is still 367.5 MB. Free memory was 333.7 MB in the beginning and 330.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:25,271 INFO L168 Benchmark]: Boogie Preprocessor took 54.35 ms. Allocated memory is still 367.5 MB. Free memory was 330.3 MB in the beginning and 326.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:25,271 INFO L168 Benchmark]: RCFGBuilder took 863.82 ms. Allocated memory is still 367.5 MB. Free memory was 326.8 MB in the beginning and 279.1 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:25,275 INFO L168 Benchmark]: TraceAbstraction took 33726.29 ms. Allocated memory was 367.5 MB in the beginning and 540.5 MB in the end (delta: 173.0 MB). Free memory was 279.1 MB in the beginning and 283.6 MB in the end (delta: -4.5 MB). Peak memory consumption was 168.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:25,279 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1330.64 ms. Allocated memory was 254.3 MB in the beginning and 367.5 MB in the end (delta: 113.2 MB). Free memory was 207.5 MB in the beginning and 333.7 MB in the end (delta: -126.2 MB). Peak memory consumption was 110.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 102.24 ms. Allocated memory is still 367.5 MB. Free memory was 333.7 MB in the beginning and 330.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 54.35 ms. Allocated memory is still 367.5 MB. Free memory was 330.3 MB in the beginning and 326.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 863.82 ms. Allocated memory is still 367.5 MB. Free memory was 326.8 MB in the beginning and 279.1 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 33726.29 ms. Allocated memory was 367.5 MB in the beginning and 540.5 MB in the end (delta: 173.0 MB). Free memory was 279.1 MB in the beginning and 283.6 MB in the end (delta: -4.5 MB). Peak memory consumption was 168.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1328 VarBasedMoverChecksPositive, 53 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 15.8s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 24.4s, 144 PlacesBefore, 36 PlacesAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 7 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 165 TotalNumberOfCompositions, 4147 MoverChecksTotal - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1695] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1700] 1 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 24.5s, HoareTripleCheckerStatistics: 284 SDtfs, 364 SDslu, 920 SDs, 0 SdLazy, 2258 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 356 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 48623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...