/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-7bb8cbd [2020-10-15 18:55:16,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:55:16,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:55:16,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:55:16,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:55:16,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:55:16,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:55:16,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:55:16,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:55:16,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:55:17,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:55:17,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:55:17,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:55:17,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:55:17,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:55:17,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:55:17,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:55:17,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:55:17,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:55:17,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:55:17,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:55:17,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:55:17,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:55:17,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:55:17,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:55:17,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:55:17,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:55:17,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:55:17,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:55:17,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:55:17,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:55:17,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:55:17,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:55:17,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:55:17,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:55:17,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:55:17,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:55:17,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:55:17,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:55:17,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:55:17,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:55:17,028 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-15 18:55:17,051 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:55:17,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:55:17,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:55:17,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:55:17,053 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:55:17,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:55:17,053 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:55:17,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:55:17,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:55:17,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:55:17,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:55:17,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:55:17,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:55:17,055 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:55:17,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:55:17,055 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:55:17,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:55:17,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:55:17,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:55:17,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:55:17,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:55:17,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:55:17,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:55:17,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:55:17,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:55:17,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:55:17,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:55:17,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:55:17,057 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:55:17,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:55:17,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:55:17,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:55:17,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:55:17,378 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:55:17,379 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:55:17,380 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-15 18:55:17,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd53ecb21/deeafa8974c54895b08a3090677a8aba/FLAG3b80532a1 [2020-10-15 18:55:18,064 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:55:18,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-15 18:55:18,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd53ecb21/deeafa8974c54895b08a3090677a8aba/FLAG3b80532a1 [2020-10-15 18:55:18,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd53ecb21/deeafa8974c54895b08a3090677a8aba [2020-10-15 18:55:18,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:55:18,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:55:18,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:55:18,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:55:18,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:55:18,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:55:18" (1/1) ... [2020-10-15 18:55:18,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7352c49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:18, skipping insertion in model container [2020-10-15 18:55:18,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:55:18" (1/1) ... [2020-10-15 18:55:18,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:55:18,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:55:19,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:55:19,127 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:55:19,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:55:19,612 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:55:19,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19 WrapperNode [2020-10-15 18:55:19,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:55:19,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:55:19,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:55:19,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:55:19,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:55:19,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:55:19,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:55:19,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:55:19,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (1/1) ... [2020-10-15 18:55:19,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:55:19,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:55:19,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:55:19,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:55:19,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (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-15 18:55:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:55:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 18:55:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-15 18:55:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:55:19,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:55:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-15 18:55:19,849 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-15 18:55:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:55:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:55:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-15 18:55:19,852 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:55:20,470 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:55:20,470 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-15 18:55:20,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:55:20 BoogieIcfgContainer [2020-10-15 18:55:20,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:55:20,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:55:20,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:55:20,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:55:20,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:55:18" (1/3) ... [2020-10-15 18:55:20,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15570622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:55:20, skipping insertion in model container [2020-10-15 18:55:20,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:19" (2/3) ... [2020-10-15 18:55:20,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15570622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:55:20, skipping insertion in model container [2020-10-15 18:55:20,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:55:20" (3/3) ... [2020-10-15 18:55:20,481 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-15 18:55:20,493 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:55:20,493 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:55:20,501 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-15 18:55:20,502 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:55:20,534 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,535 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,535 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,535 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,538 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,538 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,538 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,538 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,538 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,539 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,539 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,539 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,539 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,540 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,540 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,540 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,540 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,542 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,542 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,542 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,542 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,543 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,543 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,543 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,543 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,543 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,544 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,544 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,544 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,544 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,548 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,548 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,549 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,549 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,549 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,549 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,549 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,550 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,550 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,556 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,556 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,556 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,557 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,557 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,557 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,557 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,557 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,558 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:20,584 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-15 18:55:20,605 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:55:20,605 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:55:20,605 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:55:20,605 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:55:20,606 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:55:20,606 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:55:20,606 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:55:20,606 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:55:20,623 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:55:20,626 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-15 18:55:20,629 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-15 18:55:20,631 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-15 18:55:20,701 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-15 18:55:20,702 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-15 18:55:20,711 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-15 18:55:20,718 INFO L117 LiptonReduction]: Number of co-enabled transitions 1980 [2020-10-15 18:55:21,065 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-15 18:55:21,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,105 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-15 18:55:21,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,128 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-15 18:55:21,129 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:21,147 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-15 18:55:21,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,178 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-15 18:55:21,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,200 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-15 18:55:21,201 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:23,875 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-15 18:55:23,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:23,900 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-15 18:55:23,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:23,917 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-15 18:55:23,918 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-15 18:55:24,299 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-15 18:55:24,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,340 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-15 18:55:24,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,366 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-15 18:55:24,367 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:24,380 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-15 18:55:24,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,411 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-15 18:55:24,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,438 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-15 18:55:24,439 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:26,459 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-15 18:55:26,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,497 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-15 18:55:26,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,521 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-15 18:55:26,521 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:26,537 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-15 18:55:26,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,562 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-15 18:55:26,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,584 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-15 18:55:26,584 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:28,603 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-15 18:55:28,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,631 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-15 18:55:28,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,651 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-15 18:55:28,652 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:28,669 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-15 18:55:28,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,698 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-15 18:55:28,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,723 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-15 18:55:28,723 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:31,492 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-15 18:55:31,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:31,523 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-15 18:55:31,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:31,547 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-15 18:55:31,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 18:55:31,559 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-15 18:55:31,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:31,613 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-15 18:55:31,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:31,641 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-15 18:55:31,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:55:34,110 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-15 18:55:34,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:34,137 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-15 18:55:34,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:34,150 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-15 18:55:34,150 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-15 18:55:35,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-15 18:55:35,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,195 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-15 18:55:35,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,218 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-15 18:55:35,219 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-15 18:55:35,247 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-15 18:55:35,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,290 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-15 18:55:35,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,325 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-15 18:55:35,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-10-15 18:55:35,349 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-15 18:55:35,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,395 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-15 18:55:35,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,431 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-15 18:55:35,431 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2020-10-15 18:55:37,469 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-15 18:55:37,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,512 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-15 18:55:37,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,539 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-15 18:55:37,539 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-15 18:55:37,550 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-15 18:55:37,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,584 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-15 18:55:37,609 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,610 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-15 18:55:37,610 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:55:39,856 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-15 18:55:39,924 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-15 18:55:39,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:39,975 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-15 18:55:40,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:40,010 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-15 18:55:40,011 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-15 18:55:40,026 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-15 18:55:40,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:40,059 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-15 18:55:40,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:40,083 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-15 18:55:40,083 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:42,650 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-10-15 18:55:42,787 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-15 18:55:43,063 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-10-15 18:55:43,742 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-10-15 18:55:43,924 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-15 18:55:44,604 WARN L193 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-15 18:55:44,849 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 18:55:45,967 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-15 18:55:45,996 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-15 18:55:46,462 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-15 18:55:46,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:46,472 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-15 18:55:46,965 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 18:55:46,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:46,966 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-15 18:55:46,966 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-15 18:55:47,429 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 18:55:47,440 INFO L132 LiptonReduction]: Checked pairs total: 4147 [2020-10-15 18:55:47,440 INFO L134 LiptonReduction]: Total number of compositions: 165 [2020-10-15 18:55:47,447 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-10-15 18:55:47,466 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-10-15 18:55:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-10-15 18:55:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-15 18:55:47,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:47,476 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-15 18:55:47,476 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-15 18:55:47,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:47,482 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-10-15 18:55:47,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:47,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322326184] [2020-10-15 18:55:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:47,714 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-15 18:55:47,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322326184] [2020-10-15 18:55:47,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:47,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-15 18:55:47,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777117611] [2020-10-15 18:55:47,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-15 18:55:47,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-15 18:55:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 18:55:47,741 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-10-15 18:55:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:47,765 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-10-15 18:55:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-15 18:55:47,766 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-15 18:55:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:47,778 INFO L225 Difference]: With dead ends: 190 [2020-10-15 18:55:47,778 INFO L226 Difference]: Without dead ends: 172 [2020-10-15 18:55:47,780 INFO L677 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-15 18:55:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-15 18:55:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-10-15 18:55:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-15 18:55:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-10-15 18:55:47,840 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-10-15 18:55:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:47,841 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-10-15 18:55:47,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-15 18:55:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-10-15 18:55:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-15 18:55:47,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:47,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-15 18:55:47,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:55:47,843 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-15 18:55:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-10-15 18:55:47,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:47,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996309694] [2020-10-15 18:55:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:48,071 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-15 18:55:48,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996309694] [2020-10-15 18:55:48,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:48,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:55:48,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451004637] [2020-10-15 18:55:48,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:55:48,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:55:48,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:55:48,077 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-10-15 18:55:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:48,180 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-10-15 18:55:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:55:48,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-15 18:55:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:48,185 INFO L225 Difference]: With dead ends: 230 [2020-10-15 18:55:48,186 INFO L226 Difference]: Without dead ends: 230 [2020-10-15 18:55:48,186 INFO L677 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-15 18:55:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-15 18:55:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-15 18:55:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-15 18:55:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-15 18:55:48,211 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-15 18:55:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:48,212 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-15 18:55:48,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:55:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-15 18:55:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 18:55:48,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:48,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 18:55:48,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:55:48,213 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-15 18:55:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-10-15 18:55:48,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:48,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644210634] [2020-10-15 18:55:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:48,316 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-15 18:55:48,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644210634] [2020-10-15 18:55:48,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:48,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:55:48,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077062119] [2020-10-15 18:55:48,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:55:48,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:55:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:55:48,318 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-15 18:55:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:48,422 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-15 18:55:48,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:55:48,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 18:55:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:48,429 INFO L225 Difference]: With dead ends: 243 [2020-10-15 18:55:48,429 INFO L226 Difference]: Without dead ends: 236 [2020-10-15 18:55:48,430 INFO L677 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-15 18:55:48,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-15 18:55:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-15 18:55:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-15 18:55:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-15 18:55:48,472 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-15 18:55:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:48,472 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-15 18:55:48,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:55:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-15 18:55:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:55:48,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:48,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:48,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:55:48,477 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-15 18:55:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:48,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-10-15 18:55:48,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:48,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325730791] [2020-10-15 18:55:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:48,586 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-15 18:55:48,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325730791] [2020-10-15 18:55:48,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:48,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:55:48,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891191041] [2020-10-15 18:55:48,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:55:48,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:55:48,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:55:48,589 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-15 18:55:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:48,610 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-15 18:55:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:55:48,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:55:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:48,612 INFO L225 Difference]: With dead ends: 86 [2020-10-15 18:55:48,612 INFO L226 Difference]: Without dead ends: 86 [2020-10-15 18:55:48,613 INFO L677 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-15 18:55:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-15 18:55:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-15 18:55:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-15 18:55:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-15 18:55:48,623 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-15 18:55:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:48,624 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-15 18:55:48,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:55:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-15 18:55:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:48,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:48,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:48,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:55:48,629 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-15 18:55:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-10-15 18:55:48,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:48,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946012250] [2020-10-15 18:55:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:48,899 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-15 18:55:48,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946012250] [2020-10-15 18:55:48,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:48,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:55:48,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688614804] [2020-10-15 18:55:48,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:55:48,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:55:48,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:55:48,901 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-10-15 18:55:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:49,266 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-10-15 18:55:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:55:49,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-15 18:55:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:49,268 INFO L225 Difference]: With dead ends: 145 [2020-10-15 18:55:49,268 INFO L226 Difference]: Without dead ends: 145 [2020-10-15 18:55:49,269 INFO L677 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-15 18:55:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-15 18:55:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-10-15 18:55:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-15 18:55:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-10-15 18:55:49,274 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-10-15 18:55:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:49,275 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-10-15 18:55:49,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:55:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-10-15 18:55:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:49,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:49,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:49,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:55:49,277 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-15 18:55:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-10-15 18:55:49,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:49,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266383260] [2020-10-15 18:55:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:49,892 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-15 18:55:49,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266383260] [2020-10-15 18:55:49,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:49,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:55:49,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990097464] [2020-10-15 18:55:49,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:55:49,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:55:49,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:55:49,894 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-10-15 18:55:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:50,747 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-10-15 18:55:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:55:50,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 18:55:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:50,749 INFO L225 Difference]: With dead ends: 157 [2020-10-15 18:55:50,749 INFO L226 Difference]: Without dead ends: 136 [2020-10-15 18:55:50,750 INFO L677 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-15 18:55:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-15 18:55:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-10-15 18:55:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-15 18:55:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-10-15 18:55:50,754 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-10-15 18:55:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:50,754 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-10-15 18:55:50,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:55:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-10-15 18:55:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:50,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:50,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:50,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:55:50,757 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-15 18:55:50,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:50,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-10-15 18:55:50,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:50,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764640228] [2020-10-15 18:55:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:50,935 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-15 18:55:50,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764640228] [2020-10-15 18:55:50,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:50,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:55:50,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169840482] [2020-10-15 18:55:50,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:55:50,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:50,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:55:50,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:55:50,937 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 7 states. [2020-10-15 18:55:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:51,254 INFO L93 Difference]: Finished difference Result 158 states and 276 transitions. [2020-10-15 18:55:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:55:51,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-15 18:55:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:51,256 INFO L225 Difference]: With dead ends: 158 [2020-10-15 18:55:51,256 INFO L226 Difference]: Without dead ends: 158 [2020-10-15 18:55:51,256 INFO L677 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-15 18:55:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-15 18:55:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2020-10-15 18:55:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-15 18:55:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 200 transitions. [2020-10-15 18:55:51,261 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 200 transitions. Word has length 18 [2020-10-15 18:55:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:51,262 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 200 transitions. [2020-10-15 18:55:51,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:55:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 200 transitions. [2020-10-15 18:55:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:51,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:51,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:51,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:55:51,264 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-15 18:55:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-10-15 18:55:51,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:51,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511116240] [2020-10-15 18:55:51,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:51,845 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-15 18:55:51,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511116240] [2020-10-15 18:55:51,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:51,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:55:51,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568746030] [2020-10-15 18:55:51,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:55:51,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:55:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:55:51,848 INFO L87 Difference]: Start difference. First operand 109 states and 200 transitions. Second operand 12 states. [2020-10-15 18:55:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:52,588 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2020-10-15 18:55:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:55:52,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 18:55:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:52,591 INFO L225 Difference]: With dead ends: 137 [2020-10-15 18:55:52,591 INFO L226 Difference]: Without dead ends: 126 [2020-10-15 18:55:52,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-15 18:55:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-15 18:55:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-10-15 18:55:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-15 18:55:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 196 transitions. [2020-10-15 18:55:52,595 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 196 transitions. Word has length 18 [2020-10-15 18:55:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:52,595 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 196 transitions. [2020-10-15 18:55:52,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:55:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 196 transitions. [2020-10-15 18:55:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:52,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:52,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:52,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:55:52,597 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-15 18:55:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-10-15 18:55:52,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:52,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044685987] [2020-10-15 18:55:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:53,060 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-15 18:55:53,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044685987] [2020-10-15 18:55:53,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:53,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:55:53,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458995877] [2020-10-15 18:55:53,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:55:53,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:55:53,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:55:53,062 INFO L87 Difference]: Start difference. First operand 107 states and 196 transitions. Second operand 12 states. [2020-10-15 18:55:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:53,834 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2020-10-15 18:55:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:55:53,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 18:55:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:53,836 INFO L225 Difference]: With dead ends: 139 [2020-10-15 18:55:53,836 INFO L226 Difference]: Without dead ends: 124 [2020-10-15 18:55:53,837 INFO L677 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-15 18:55:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-15 18:55:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-10-15 18:55:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-15 18:55:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 192 transitions. [2020-10-15 18:55:53,841 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 192 transitions. Word has length 18 [2020-10-15 18:55:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:53,841 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 192 transitions. [2020-10-15 18:55:53,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:55:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 192 transitions. [2020-10-15 18:55:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:53,842 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:53,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:53,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:55:53,843 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-15 18:55:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:53,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1672062081, now seen corresponding path program 4 times [2020-10-15 18:55:53,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:53,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237329206] [2020-10-15 18:55:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:54,293 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-15 18:55:54,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237329206] [2020-10-15 18:55:54,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:54,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:55:54,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503815683] [2020-10-15 18:55:54,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:55:54,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:55:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:55:54,296 INFO L87 Difference]: Start difference. First operand 105 states and 192 transitions. Second operand 12 states. [2020-10-15 18:55:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:55,077 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-10-15 18:55:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:55:55,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 18:55:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:55,080 INFO L225 Difference]: With dead ends: 136 [2020-10-15 18:55:55,080 INFO L226 Difference]: Without dead ends: 113 [2020-10-15 18:55:55,080 INFO L677 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-15 18:55:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-15 18:55:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-10-15 18:55:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-15 18:55:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2020-10-15 18:55:55,084 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2020-10-15 18:55:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:55,084 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2020-10-15 18:55:55,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:55:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2020-10-15 18:55:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:55,085 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:55,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:55,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:55:55,085 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-15 18:55:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:55,086 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-10-15 18:55:55,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:55,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388536807] [2020-10-15 18:55:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:55,443 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-15 18:55:55,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388536807] [2020-10-15 18:55:55,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:55,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 18:55:55,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274154406] [2020-10-15 18:55:55,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 18:55:55,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 18:55:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:55:55,445 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2020-10-15 18:55:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:55,980 INFO L93 Difference]: Finished difference Result 153 states and 270 transitions. [2020-10-15 18:55:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:55:55,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-15 18:55:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:55,982 INFO L225 Difference]: With dead ends: 153 [2020-10-15 18:55:55,982 INFO L226 Difference]: Without dead ends: 132 [2020-10-15 18:55:55,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-15 18:55:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-15 18:55:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2020-10-15 18:55:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-15 18:55:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2020-10-15 18:55:55,987 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 18 [2020-10-15 18:55:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:55,987 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2020-10-15 18:55:55,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 18:55:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2020-10-15 18:55:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:55,988 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:55,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:55,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:55:55,989 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-15 18:55:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 3 times [2020-10-15 18:55:55,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:55,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446772034] [2020-10-15 18:55:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:55:56,240 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-15 18:55:56,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446772034] [2020-10-15 18:55:56,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:55:56,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:55:56,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190535247] [2020-10-15 18:55:56,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:55:56,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:55:56,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:55:56,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:55:56,242 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 9 states. [2020-10-15 18:55:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:55:56,768 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2020-10-15 18:55:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:55:56,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-15 18:55:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:55:56,771 INFO L225 Difference]: With dead ends: 229 [2020-10-15 18:55:56,771 INFO L226 Difference]: Without dead ends: 229 [2020-10-15 18:55:56,772 INFO L677 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-15 18:55:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-15 18:55:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 123. [2020-10-15 18:55:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-15 18:55:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 223 transitions. [2020-10-15 18:55:56,777 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 223 transitions. Word has length 18 [2020-10-15 18:55:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:55:56,777 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 223 transitions. [2020-10-15 18:55:56,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:55:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 223 transitions. [2020-10-15 18:55:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:55:56,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:55:56,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:55:56,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:55:56,779 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-15 18:55:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:55:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-10-15 18:55:56,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:55:56,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540326485] [2020-10-15 18:55:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:55:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:55:56,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:55:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:55:56,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:55:56,865 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:55:56,865 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:55:56,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:55:56,866 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:55:56,866 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:55:56,867 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:55:56,872 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse0 (select |#memory_int_In1424113372| ULTIMATE.start_my_drv_probe_~data.base_In1424113372))) (and (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In1424113372 24)) 0) (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In1424113372 28)) |ULTIMATE.start_my_drv_probe_#t~mem32_Out1424113372|) (= ULTIMATE.start_ldv_assert_~expression_Out1424113372 1) (let ((.cse1 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out1424113372| 0))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out1424113372| 1) .cse1) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out1424113372| 0) (not .cse1)))))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In1424113372, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In1424113372, #memory_int=|#memory_int_In1424113372|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out1424113372|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out1424113372|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In1424113372, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In1424113372, #memory_int=|#memory_int_In1424113372|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1424113372|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1424113372} 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-15 18:55:56,872 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out-139382336 |ULTIMATE.start_ldv_assert_#in~expression_In-139382336|) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In-139382336| 2147483648)) (not (= ULTIMATE.start_ldv_assert_~expression_Out-139382336 0)) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In-139382336| 2147483647)) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-139382336|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-139382336|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-139382336|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-139382336|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-139382336|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-139382336} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-15 18:55:56,878 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In862191426| |ULTIMATE.start_main_~#data~1.base_In862191426|))) (and (= ULTIMATE.start_ldv_assert_~expression_Out862191426 1) (= |ULTIMATE.start_main_#t~mem43_Out862191426| (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In862191426| 28))) (let ((.cse1 (= |ULTIMATE.start_main_#t~mem43_Out862191426| 2))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out862191426| 1) .cse1) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out862191426| 0) (not .cse1)))) (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In862191426| 24)) 1))) InVars {#memory_int=|#memory_int_In862191426|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In862191426|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In862191426|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out862191426|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out862191426|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out862191426|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out862191426|, #memory_int=|#memory_int_In862191426|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In862191426|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out862191426|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In862191426|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out862191426} 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-15 18:55:56,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:55:56 BasicIcfg [2020-10-15 18:55:56,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:55:56,923 INFO L168 Benchmark]: Toolchain (without parser) took 38641.84 ms. Allocated memory was 246.9 MB in the beginning and 535.3 MB in the end (delta: 288.4 MB). Free memory was 197.1 MB in the beginning and 200.6 MB in the end (delta: -3.5 MB). Peak memory consumption was 284.8 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:56,924 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 246.9 MB. Free memory is still 220.8 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:55:56,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1330.25 ms. Allocated memory was 246.9 MB in the beginning and 354.4 MB in the end (delta: 107.5 MB). Free memory was 197.1 MB in the beginning and 313.1 MB in the end (delta: -116.1 MB). Peak memory consumption was 106.8 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:56,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.46 ms. Allocated memory is still 354.4 MB. Free memory was 313.1 MB in the beginning and 309.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:56,925 INFO L168 Benchmark]: Boogie Preprocessor took 45.18 ms. Allocated memory is still 354.4 MB. Free memory is still 309.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:55:56,926 INFO L168 Benchmark]: RCFGBuilder took 689.48 ms. Allocated memory is still 354.4 MB. Free memory was 309.6 MB in the beginning and 260.8 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:56,927 INFO L168 Benchmark]: TraceAbstraction took 36448.14 ms. Allocated memory was 354.4 MB in the beginning and 535.3 MB in the end (delta: 180.9 MB). Free memory was 260.8 MB in the beginning and 200.6 MB in the end (delta: 60.2 MB). Peak memory consumption was 241.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:55:56,930 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.95 ms. Allocated memory is still 246.9 MB. Free memory is still 220.8 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1330.25 ms. Allocated memory was 246.9 MB in the beginning and 354.4 MB in the end (delta: 107.5 MB). Free memory was 197.1 MB in the beginning and 313.1 MB in the end (delta: -116.1 MB). Peak memory consumption was 106.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 123.46 ms. Allocated memory is still 354.4 MB. Free memory was 313.1 MB in the beginning and 309.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.18 ms. Allocated memory is still 354.4 MB. Free memory is still 309.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 689.48 ms. Allocated memory is still 354.4 MB. Free memory was 309.6 MB in the beginning and 260.8 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 36448.14 ms. Allocated memory was 354.4 MB in the beginning and 535.3 MB in the end (delta: 180.9 MB). Free memory was 260.8 MB in the beginning and 200.6 MB in the end (delta: 60.2 MB). Peak memory consumption was 241.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1328 VarBasedMoverChecksPositive, 53 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 8 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 17.8s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 26.8s, 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: 36.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.8s, HoareTripleCheckerStatistics: 284 SDtfs, 364 SDslu, 920 SDs, 0 SdLazy, 2258 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.2s 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.9s 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...