/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:40:55,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:40:55,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:40:55,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:40:55,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:40:55,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:40:55,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:40:55,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:40:55,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:40:55,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:40:55,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:40:55,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:40:55,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:40:56,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:40:56,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:40:56,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:40:56,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:40:56,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:40:56,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:40:56,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:40:56,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:40:56,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:40:56,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:40:56,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:40:56,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:40:56,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:40:56,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:40:56,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:40:56,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:40:56,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:40:56,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:40:56,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:40:56,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:40:56,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:40:56,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:40:56,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:40:56,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:40:56,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:40:56,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:40:56,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:40:56,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:40:56,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 23:40:56,118 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:40:56,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:40:56,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:40:56,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:40:56,124 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:40:56,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:40:56,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:40:56,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:40:56,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:40:56,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:40:56,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:40:56,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:40:56,126 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:40:56,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:40:56,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:40:56,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:40:56,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:40:56,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:40:56,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:40:56,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:40:56,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:40:56,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:40:56,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:40:56,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:40:56,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:40:56,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 23:40:56,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:40:56,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:40:56,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:40:56,564 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:40:56,565 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:40:56,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2021-01-06 23:40:56,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d95dc4682/b12e6230cf1142fa89d0981f296b2e47/FLAG0485fbc2c [2021-01-06 23:40:57,574 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:40:57,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2021-01-06 23:40:57,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d95dc4682/b12e6230cf1142fa89d0981f296b2e47/FLAG0485fbc2c [2021-01-06 23:40:57,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d95dc4682/b12e6230cf1142fa89d0981f296b2e47 [2021-01-06 23:40:57,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:40:57,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:40:57,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:40:57,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:40:57,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:40:57,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:40:57" (1/1) ... [2021-01-06 23:40:57,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb6a966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:57, skipping insertion in model container [2021-01-06 23:40:57,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:40:57" (1/1) ... [2021-01-06 23:40:57,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:40:57,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:40:58,059 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-01-06 23:40:58,590 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[75002,75015] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~probe_ret~0,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~data~1,],shared],a] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~data~1,],shared],b] [2021-01-06 23:40:58,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:40:58,636 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:40:58,650 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-01-06 23:40:58,695 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[75002,75015] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~probe_ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#data~1,],offset]]]] [2021-01-06 23:40:58,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:40:59,207 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:40:59,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59 WrapperNode [2021-01-06 23:40:59,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:40:59,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:40:59,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:40:59,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:40:59,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:40:59,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:40:59,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:40:59,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:40:59,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... [2021-01-06 23:40:59,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:40:59,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:40:59,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:40:59,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:40:59,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 23:40:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:40:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:40:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:40:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 23:40:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 23:40:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:40:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:40:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-01-06 23:40:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-01-06 23:40:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:40:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:40:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:40:59,457 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 23:41:00,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:41:00,185 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2021-01-06 23:41:00,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:00 BoogieIcfgContainer [2021-01-06 23:41:00,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:41:00,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:41:00,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:41:00,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:41:00,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:40:57" (1/3) ... [2021-01-06 23:41:00,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9000a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:41:00, skipping insertion in model container [2021-01-06 23:41:00,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:59" (2/3) ... [2021-01-06 23:41:00,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9000a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:41:00, skipping insertion in model container [2021-01-06 23:41:00,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:00" (3/3) ... [2021-01-06 23:41:00,198 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2021-01-06 23:41:00,205 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:41:00,206 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:41:00,211 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2021-01-06 23:41:00,212 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:41:00,258 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,260 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,260 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,271 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,271 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,271 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,272 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,273 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,274 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,275 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,275 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,275 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,275 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,276 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,276 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,276 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,278 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,279 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,283 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,283 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,285 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,285 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,285 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,285 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,285 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,285 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,286 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,289 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,289 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,290 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,290 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,292 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,292 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,293 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,293 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,293 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,293 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,293 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,293 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,294 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,294 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,294 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,294 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,295 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,295 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,295 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,295 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,296 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,297 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,301 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,308 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,308 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,308 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,308 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,309 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,309 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,309 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,309 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,310 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,314 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,314 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,319 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,319 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,320 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:41:00,334 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-01-06 23:41:00,355 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-06 23:41:00,392 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:41:00,392 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:41:00,392 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:41:00,392 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:41:00,392 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:41:00,392 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:41:00,393 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:41:00,393 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:41:00,417 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:41:00,419 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 137 transitions, 296 flow [2021-01-06 23:41:00,423 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 137 transitions, 296 flow [2021-01-06 23:41:00,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 137 transitions, 296 flow [2021-01-06 23:41:00,542 INFO L129 PetriNetUnfolder]: 9/177 cut-off events. [2021-01-06 23:41:00,543 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-01-06 23:41:00,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 177 events. 9/177 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 367 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2021-01-06 23:41:00,555 INFO L116 LiptonReduction]: Number of co-enabled transitions 2060 [2021-01-06 23:41:01,363 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,399 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,428 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,428 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:41:01,449 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,485 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:01,508 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:01,508 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:03,542 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:03,606 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:03,641 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:03,660 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:03,695 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:03,719 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:03,720 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2021-01-06 23:41:06,100 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,134 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,160 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,160 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:41:06,178 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,212 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:06,237 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:06,237 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:08,879 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:08,906 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:08,912 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:08,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:08,941 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:08,942 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2021-01-06 23:41:08,962 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:08,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:08,997 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:09,020 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:09,021 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2021-01-06 23:41:11,626 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,672 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,710 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,711 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2021-01-06 23:41:11,731 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,781 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:11,821 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:11,821 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2021-01-06 23:41:13,842 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:13,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:13,887 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:13,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:13,920 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:13,920 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2021-01-06 23:41:13,945 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:13,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:13,987 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:14,017 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:14,018 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2021-01-06 23:41:16,669 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,690 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,700 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,721 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,722 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:16,742 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,772 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:16,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:16,793 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:41:18,999 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:19,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:19,028 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:19,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:19,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:19,050 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:19,066 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:19,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:19,099 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:19,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:19,121 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:19,121 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:41:21,937 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:21,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:21,981 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:22,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:22,020 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:22,021 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2021-01-06 23:41:22,038 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:22,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:22,087 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:22,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:22,131 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:22,132 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2021-01-06 23:41:24,781 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,836 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:24,842 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:24,890 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,891 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:133 [2021-01-06 23:41:24,913 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:24,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:24,970 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:25,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:25,015 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:25,016 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:133 [2021-01-06 23:41:27,037 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:27,082 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:27,124 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2021-01-06 23:41:27,139 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:27,186 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:27,226 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:27,226 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2021-01-06 23:41:29,436 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:29,499 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:29,548 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2021-01-06 23:41:29,564 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:29,620 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:29,685 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:29,685 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2021-01-06 23:41:31,812 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:31,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:31,881 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:31,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:31,939 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:31,939 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2021-01-06 23:41:31,969 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:32,042 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,097 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:32,099 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:32,099 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2021-01-06 23:41:35,177 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-06 23:41:35,427 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-06 23:41:35,559 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-01-06 23:41:35,731 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-06 23:41:35,864 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-01-06 23:41:35,915 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:35,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:35,954 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:35,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:35,987 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:35,988 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2021-01-06 23:41:36,002 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:36,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:36,043 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:36,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 23:41:36,075 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 23:41:36,076 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2021-01-06 23:41:38,919 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2021-01-06 23:41:39,043 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 23:41:39,302 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2021-01-06 23:41:39,416 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 23:41:39,742 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 23:41:40,223 WARN L197 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2021-01-06 23:41:40,395 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-01-06 23:41:40,780 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2021-01-06 23:41:40,963 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-01-06 23:41:41,271 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2021-01-06 23:41:42,391 WARN L197 SmtUtils]: Spent 917.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2021-01-06 23:41:43,332 WARN L197 SmtUtils]: Spent 939.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2021-01-06 23:41:44,450 WARN L197 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 152 [2021-01-06 23:41:45,550 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 152 [2021-01-06 23:41:45,987 WARN L197 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 23:41:46,439 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 23:41:46,946 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 23:41:47,458 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 23:41:47,466 INFO L131 LiptonReduction]: Checked pairs total: 4079 [2021-01-06 23:41:47,466 INFO L133 LiptonReduction]: Total number of compositions: 141 [2021-01-06 23:41:47,473 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 34 transitions, 90 flow [2021-01-06 23:41:47,494 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 207 states. [2021-01-06 23:41:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2021-01-06 23:41:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-06 23:41:47,502 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:47,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-06 23:41:47,503 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash 15015073, now seen corresponding path program 1 times [2021-01-06 23:41:47,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:47,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69040070] [2021-01-06 23:41:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:47,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69040070] [2021-01-06 23:41:47,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:47,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:41:47,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294402031] [2021-01-06 23:41:47,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:41:47,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:41:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:41:48,018 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2021-01-06 23:41:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:48,203 INFO L93 Difference]: Finished difference Result 280 states and 638 transitions. [2021-01-06 23:41:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:41:48,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-06 23:41:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:48,220 INFO L225 Difference]: With dead ends: 280 [2021-01-06 23:41:48,220 INFO L226 Difference]: Without dead ends: 262 [2021-01-06 23:41:48,222 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 [2021-01-06 23:41:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-01-06 23:41:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 217. [2021-01-06 23:41:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 23:41:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 485 transitions. [2021-01-06 23:41:48,289 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 485 transitions. Word has length 4 [2021-01-06 23:41:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:48,289 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 485 transitions. [2021-01-06 23:41:48,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:41:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 485 transitions. [2021-01-06 23:41:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-06 23:41:48,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:48,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-06 23:41:48,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:41:48,291 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1544597556, now seen corresponding path program 1 times [2021-01-06 23:41:48,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:48,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474472251] [2021-01-06 23:41:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:48,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474472251] [2021-01-06 23:41:48,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:48,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:41:48,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908349237] [2021-01-06 23:41:48,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:41:48,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:41:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:41:48,415 INFO L87 Difference]: Start difference. First operand 217 states and 485 transitions. Second operand 4 states. [2021-01-06 23:41:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:48,570 INFO L93 Difference]: Finished difference Result 291 states and 637 transitions. [2021-01-06 23:41:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:41:48,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2021-01-06 23:41:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:48,575 INFO L225 Difference]: With dead ends: 291 [2021-01-06 23:41:48,576 INFO L226 Difference]: Without dead ends: 251 [2021-01-06 23:41:48,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:41:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-01-06 23:41:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 236. [2021-01-06 23:41:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-01-06 23:41:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 542 transitions. [2021-01-06 23:41:48,601 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 542 transitions. Word has length 6 [2021-01-06 23:41:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:48,602 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 542 transitions. [2021-01-06 23:41:48,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:41:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 542 transitions. [2021-01-06 23:41:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 23:41:48,603 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:48,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:48,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:41:48,604 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1061783637, now seen corresponding path program 1 times [2021-01-06 23:41:48,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:48,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617538027] [2021-01-06 23:41:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:48,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617538027] [2021-01-06 23:41:48,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:48,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:41:48,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063016749] [2021-01-06 23:41:48,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:41:48,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:41:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:41:48,673 INFO L87 Difference]: Start difference. First operand 236 states and 542 transitions. Second operand 3 states. [2021-01-06 23:41:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:48,692 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2021-01-06 23:41:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:41:48,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-06 23:41:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:48,693 INFO L225 Difference]: With dead ends: 86 [2021-01-06 23:41:48,693 INFO L226 Difference]: Without dead ends: 86 [2021-01-06 23:41:48,694 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 [2021-01-06 23:41:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-01-06 23:41:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-01-06 23:41:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-06 23:41:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2021-01-06 23:41:48,701 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2021-01-06 23:41:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:48,701 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2021-01-06 23:41:48,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:41:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2021-01-06 23:41:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:48,703 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:48,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:48,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:41:48,704 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2009095163, now seen corresponding path program 1 times [2021-01-06 23:41:48,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:48,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071960699] [2021-01-06 23:41:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:48,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071960699] [2021-01-06 23:41:48,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:48,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:41:48,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772114399] [2021-01-06 23:41:48,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:41:48,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:48,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:41:48,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:41:48,917 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 8 states. [2021-01-06 23:41:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:49,263 INFO L93 Difference]: Finished difference Result 104 states and 197 transitions. [2021-01-06 23:41:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 23:41:49,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 23:41:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:49,265 INFO L225 Difference]: With dead ends: 104 [2021-01-06 23:41:49,265 INFO L226 Difference]: Without dead ends: 104 [2021-01-06 23:41:49,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:41:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-06 23:41:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2021-01-06 23:41:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-01-06 23:41:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 187 transitions. [2021-01-06 23:41:49,273 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 187 transitions. Word has length 18 [2021-01-06 23:41:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:49,273 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 187 transitions. [2021-01-06 23:41:49,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:41:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 187 transitions. [2021-01-06 23:41:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:49,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:49,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:49,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:41:49,275 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1980466973, now seen corresponding path program 1 times [2021-01-06 23:41:49,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:49,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698991471] [2021-01-06 23:41:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:49,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698991471] [2021-01-06 23:41:49,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:49,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:41:49,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743439943] [2021-01-06 23:41:49,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:41:49,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:49,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:41:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:41:49,932 INFO L87 Difference]: Start difference. First operand 98 states and 187 transitions. Second operand 14 states. [2021-01-06 23:41:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:51,242 INFO L93 Difference]: Finished difference Result 181 states and 322 transitions. [2021-01-06 23:41:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:41:51,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:41:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:51,244 INFO L225 Difference]: With dead ends: 181 [2021-01-06 23:41:51,244 INFO L226 Difference]: Without dead ends: 181 [2021-01-06 23:41:51,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:41:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-01-06 23:41:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 118. [2021-01-06 23:41:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-06 23:41:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 218 transitions. [2021-01-06 23:41:51,253 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 218 transitions. Word has length 18 [2021-01-06 23:41:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:51,253 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 218 transitions. [2021-01-06 23:41:51,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:41:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 218 transitions. [2021-01-06 23:41:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:51,255 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:51,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:51,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:41:51,255 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1980466986, now seen corresponding path program 1 times [2021-01-06 23:41:51,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:51,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079761912] [2021-01-06 23:41:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:51,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079761912] [2021-01-06 23:41:51,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:51,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:41:51,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116426509] [2021-01-06 23:41:51,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:41:51,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:51,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:41:51,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:41:51,490 INFO L87 Difference]: Start difference. First operand 118 states and 218 transitions. Second operand 8 states. [2021-01-06 23:41:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:51,882 INFO L93 Difference]: Finished difference Result 144 states and 259 transitions. [2021-01-06 23:41:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:41:51,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 23:41:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:51,884 INFO L225 Difference]: With dead ends: 144 [2021-01-06 23:41:51,884 INFO L226 Difference]: Without dead ends: 126 [2021-01-06 23:41:51,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:41:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-01-06 23:41:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2021-01-06 23:41:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-01-06 23:41:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 210 transitions. [2021-01-06 23:41:51,890 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 210 transitions. Word has length 18 [2021-01-06 23:41:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:51,891 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 210 transitions. [2021-01-06 23:41:51,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:41:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 210 transitions. [2021-01-06 23:41:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:51,892 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:51,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:51,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:41:51,893 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:51,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2003949429, now seen corresponding path program 2 times [2021-01-06 23:41:51,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:51,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000284427] [2021-01-06 23:41:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:52,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000284427] [2021-01-06 23:41:52,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:52,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 23:41:52,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456815079] [2021-01-06 23:41:52,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 23:41:52,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 23:41:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:41:52,204 INFO L87 Difference]: Start difference. First operand 114 states and 210 transitions. Second operand 12 states. [2021-01-06 23:41:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:53,207 INFO L93 Difference]: Finished difference Result 232 states and 406 transitions. [2021-01-06 23:41:53,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 23:41:53,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2021-01-06 23:41:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:53,210 INFO L225 Difference]: With dead ends: 232 [2021-01-06 23:41:53,210 INFO L226 Difference]: Without dead ends: 214 [2021-01-06 23:41:53,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:41:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-01-06 23:41:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 135. [2021-01-06 23:41:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-01-06 23:41:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 261 transitions. [2021-01-06 23:41:53,217 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 261 transitions. Word has length 18 [2021-01-06 23:41:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:53,217 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 261 transitions. [2021-01-06 23:41:53,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 23:41:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 261 transitions. [2021-01-06 23:41:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:53,219 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:53,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:53,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:41:53,219 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2032577619, now seen corresponding path program 2 times [2021-01-06 23:41:53,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:53,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174318991] [2021-01-06 23:41:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:53,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174318991] [2021-01-06 23:41:53,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:53,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:41:53,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071796638] [2021-01-06 23:41:53,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:41:53,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:41:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:41:53,786 INFO L87 Difference]: Start difference. First operand 135 states and 261 transitions. Second operand 14 states. [2021-01-06 23:41:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:55,091 INFO L93 Difference]: Finished difference Result 247 states and 439 transitions. [2021-01-06 23:41:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:41:55,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:41:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:55,096 INFO L225 Difference]: With dead ends: 247 [2021-01-06 23:41:55,096 INFO L226 Difference]: Without dead ends: 247 [2021-01-06 23:41:55,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:41:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-01-06 23:41:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 162. [2021-01-06 23:41:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2021-01-06 23:41:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 301 transitions. [2021-01-06 23:41:55,104 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 301 transitions. Word has length 18 [2021-01-06 23:41:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:55,105 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 301 transitions. [2021-01-06 23:41:55,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:41:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 301 transitions. [2021-01-06 23:41:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:55,106 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:55,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:55,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:41:55,106 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2032577606, now seen corresponding path program 2 times [2021-01-06 23:41:55,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:55,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945258120] [2021-01-06 23:41:55,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:55,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945258120] [2021-01-06 23:41:55,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:55,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:41:55,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074444502] [2021-01-06 23:41:55,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:41:55,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:55,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:41:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:41:55,334 INFO L87 Difference]: Start difference. First operand 162 states and 301 transitions. Second operand 8 states. [2021-01-06 23:41:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:55,663 INFO L93 Difference]: Finished difference Result 211 states and 373 transitions. [2021-01-06 23:41:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:41:55,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 23:41:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:55,665 INFO L225 Difference]: With dead ends: 211 [2021-01-06 23:41:55,666 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 23:41:55,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-06 23:41:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 23:41:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157. [2021-01-06 23:41:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-01-06 23:41:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 294 transitions. [2021-01-06 23:41:55,677 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 294 transitions. Word has length 18 [2021-01-06 23:41:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:55,678 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 294 transitions. [2021-01-06 23:41:55,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:41:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 294 transitions. [2021-01-06 23:41:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:55,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:55,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:55,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 23:41:55,679 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1774018969, now seen corresponding path program 3 times [2021-01-06 23:41:55,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:55,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622383577] [2021-01-06 23:41:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:56,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622383577] [2021-01-06 23:41:56,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:56,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:41:56,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147189938] [2021-01-06 23:41:56,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:41:56,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:41:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:41:56,301 INFO L87 Difference]: Start difference. First operand 157 states and 294 transitions. Second operand 14 states. [2021-01-06 23:41:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:57,502 INFO L93 Difference]: Finished difference Result 240 states and 430 transitions. [2021-01-06 23:41:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:41:57,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:41:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:57,505 INFO L225 Difference]: With dead ends: 240 [2021-01-06 23:41:57,505 INFO L226 Difference]: Without dead ends: 209 [2021-01-06 23:41:57,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:41:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-06 23:41:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 146. [2021-01-06 23:41:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 23:41:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 278 transitions. [2021-01-06 23:41:57,514 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 278 transitions. Word has length 18 [2021-01-06 23:41:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:57,514 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 278 transitions. [2021-01-06 23:41:57,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:41:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 278 transitions. [2021-01-06 23:41:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:57,515 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:57,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:57,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 23:41:57,516 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash 416052821, now seen corresponding path program 4 times [2021-01-06 23:41:57,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:57,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725995361] [2021-01-06 23:41:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:57,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725995361] [2021-01-06 23:41:57,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:57,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:41:57,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217358116] [2021-01-06 23:41:57,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:41:57,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:41:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:41:57,990 INFO L87 Difference]: Start difference. First operand 146 states and 278 transitions. Second operand 14 states. [2021-01-06 23:41:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:41:59,380 INFO L93 Difference]: Finished difference Result 354 states and 630 transitions. [2021-01-06 23:41:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:41:59,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:41:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:41:59,383 INFO L225 Difference]: With dead ends: 354 [2021-01-06 23:41:59,383 INFO L226 Difference]: Without dead ends: 336 [2021-01-06 23:41:59,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:41:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-01-06 23:41:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 154. [2021-01-06 23:41:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 23:41:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 296 transitions. [2021-01-06 23:41:59,393 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 296 transitions. Word has length 18 [2021-01-06 23:41:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:41:59,393 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 296 transitions. [2021-01-06 23:41:59,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:41:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 296 transitions. [2021-01-06 23:41:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:41:59,394 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:41:59,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:41:59,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 23:41:59,395 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:41:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:41:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash 134130117, now seen corresponding path program 5 times [2021-01-06 23:41:59,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:41:59,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324953911] [2021-01-06 23:41:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:41:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:41:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:41:59,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324953911] [2021-01-06 23:41:59,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:41:59,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:41:59,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859331970] [2021-01-06 23:41:59,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:41:59,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:41:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:41:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:41:59,917 INFO L87 Difference]: Start difference. First operand 154 states and 296 transitions. Second operand 14 states. [2021-01-06 23:42:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:01,417 INFO L93 Difference]: Finished difference Result 330 states and 587 transitions. [2021-01-06 23:42:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:42:01,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:42:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:01,420 INFO L225 Difference]: With dead ends: 330 [2021-01-06 23:42:01,420 INFO L226 Difference]: Without dead ends: 307 [2021-01-06 23:42:01,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-01-06 23:42:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-01-06 23:42:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 158. [2021-01-06 23:42:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2021-01-06 23:42:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 300 transitions. [2021-01-06 23:42:01,429 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 300 transitions. Word has length 18 [2021-01-06 23:42:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:01,429 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 300 transitions. [2021-01-06 23:42:01,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:42:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 300 transitions. [2021-01-06 23:42:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:42:01,430 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:01,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:42:01,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 23:42:01,430 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash -124428533, now seen corresponding path program 6 times [2021-01-06 23:42:01,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:01,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261953293] [2021-01-06 23:42:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:01,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261953293] [2021-01-06 23:42:01,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:01,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:42:01,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180239791] [2021-01-06 23:42:01,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:42:01,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:42:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:42:01,983 INFO L87 Difference]: Start difference. First operand 158 states and 300 transitions. Second operand 14 states. [2021-01-06 23:42:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:03,351 INFO L93 Difference]: Finished difference Result 312 states and 561 transitions. [2021-01-06 23:42:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:42:03,351 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:42:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:03,353 INFO L225 Difference]: With dead ends: 312 [2021-01-06 23:42:03,353 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 23:42:03,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:42:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 23:42:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 150. [2021-01-06 23:42:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-06 23:42:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 286 transitions. [2021-01-06 23:42:03,363 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 286 transitions. Word has length 18 [2021-01-06 23:42:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:03,363 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 286 transitions. [2021-01-06 23:42:03,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:42:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 286 transitions. [2021-01-06 23:42:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:42:03,364 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:03,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:42:03,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 23:42:03,364 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1527933187, now seen corresponding path program 7 times [2021-01-06 23:42:03,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:03,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231686961] [2021-01-06 23:42:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:03,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231686961] [2021-01-06 23:42:03,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:03,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:42:03,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516193152] [2021-01-06 23:42:03,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:42:03,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:03,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:42:03,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:42:03,779 INFO L87 Difference]: Start difference. First operand 150 states and 286 transitions. Second operand 14 states. [2021-01-06 23:42:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:05,169 INFO L93 Difference]: Finished difference Result 295 states and 536 transitions. [2021-01-06 23:42:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:42:05,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:42:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:05,172 INFO L225 Difference]: With dead ends: 295 [2021-01-06 23:42:05,172 INFO L226 Difference]: Without dead ends: 277 [2021-01-06 23:42:05,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:42:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-01-06 23:42:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 151. [2021-01-06 23:42:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 23:42:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 287 transitions. [2021-01-06 23:42:05,179 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 287 transitions. Word has length 18 [2021-01-06 23:42:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:05,179 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 287 transitions. [2021-01-06 23:42:05,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:42:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 287 transitions. [2021-01-06 23:42:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:42:05,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:05,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:42:05,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 23:42:05,180 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash 85633547, now seen corresponding path program 8 times [2021-01-06 23:42:05,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:05,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672412690] [2021-01-06 23:42:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:05,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672412690] [2021-01-06 23:42:05,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:05,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:42:05,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971634959] [2021-01-06 23:42:05,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:42:05,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:42:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:42:05,675 INFO L87 Difference]: Start difference. First operand 151 states and 287 transitions. Second operand 14 states. [2021-01-06 23:42:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:07,297 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2021-01-06 23:42:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:42:07,297 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2021-01-06 23:42:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:07,300 INFO L225 Difference]: With dead ends: 291 [2021-01-06 23:42:07,301 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 23:42:07,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:42:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 23:42:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 166. [2021-01-06 23:42:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2021-01-06 23:42:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 309 transitions. [2021-01-06 23:42:07,308 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 309 transitions. Word has length 18 [2021-01-06 23:42:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:07,308 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 309 transitions. [2021-01-06 23:42:07,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:42:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 309 transitions. [2021-01-06 23:42:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:42:07,309 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:07,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:42:07,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 23:42:07,309 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 85633534, now seen corresponding path program 3 times [2021-01-06 23:42:07,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:07,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821355767] [2021-01-06 23:42:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:42:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:42:07,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821355767] [2021-01-06 23:42:07,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:42:07,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 23:42:07,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301479394] [2021-01-06 23:42:07,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 23:42:07,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:42:07,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 23:42:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 23:42:07,603 INFO L87 Difference]: Start difference. First operand 166 states and 309 transitions. Second operand 11 states. [2021-01-06 23:42:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:42:08,349 INFO L93 Difference]: Finished difference Result 272 states and 488 transitions. [2021-01-06 23:42:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 23:42:08,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2021-01-06 23:42:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:42:08,351 INFO L225 Difference]: With dead ends: 272 [2021-01-06 23:42:08,351 INFO L226 Difference]: Without dead ends: 258 [2021-01-06 23:42:08,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-01-06 23:42:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-01-06 23:42:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 164. [2021-01-06 23:42:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2021-01-06 23:42:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 314 transitions. [2021-01-06 23:42:08,358 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 314 transitions. Word has length 18 [2021-01-06 23:42:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:42:08,358 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 314 transitions. [2021-01-06 23:42:08,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 23:42:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 314 transitions. [2021-01-06 23:42:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:42:08,363 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:42:08,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:42:08,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 23:42:08,363 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:42:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:42:08,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1941627027, now seen corresponding path program 9 times [2021-01-06 23:42:08,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:42:08,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63842930] [2021-01-06 23:42:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:42:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:42:08,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:42:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:42:08,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:42:08,571 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:42:08,572 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:42:08,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 23:42:08,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:42:08 BasicIcfg [2021-01-06 23:42:08,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:42:08,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:42:08,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:42:08,695 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:42:08,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:00" (3/4) ... [2021-01-06 23:42:08,698 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:42:08,815 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-races/race-2_2-container_of.i-witness.graphml [2021-01-06 23:42:08,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:42:08,816 INFO L168 Benchmark]: Toolchain (without parser) took 71102.69 ms. Allocated memory was 167.8 MB in the beginning and 247.5 MB in the end (delta: 79.7 MB). Free memory was 139.0 MB in the beginning and 115.5 MB in the end (delta: 23.5 MB). Peak memory consumption was 104.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:42:08,816 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 167.8 MB. Free memory is still 139.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:42:08,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1492.07 ms. Allocated memory was 167.8 MB in the beginning and 205.5 MB in the end (delta: 37.7 MB). Free memory was 138.8 MB in the beginning and 166.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 89.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:42:08,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.81 ms. Allocated memory is still 205.5 MB. Free memory was 166.2 MB in the beginning and 163.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:42:08,818 INFO L168 Benchmark]: Boogie Preprocessor took 70.81 ms. Allocated memory is still 205.5 MB. Free memory was 163.1 MB in the beginning and 161.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:42:08,818 INFO L168 Benchmark]: RCFGBuilder took 828.38 ms. Allocated memory is still 205.5 MB. Free memory was 160.5 MB in the beginning and 114.3 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:42:08,820 INFO L168 Benchmark]: TraceAbstraction took 68503.30 ms. Allocated memory was 205.5 MB in the beginning and 247.5 MB in the end (delta: 41.9 MB). Free memory was 113.8 MB in the beginning and 123.4 MB in the end (delta: -9.6 MB). Peak memory consumption was 32.4 MB. Max. memory is 8.0 GB. [2021-01-06 23:42:08,820 INFO L168 Benchmark]: Witness Printer took 120.35 ms. Allocated memory is still 247.5 MB. Free memory was 123.4 MB in the beginning and 115.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 23:42:08,823 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 167.8 MB. Free memory is still 139.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1492.07 ms. Allocated memory was 167.8 MB in the beginning and 205.5 MB in the end (delta: 37.7 MB). Free memory was 138.8 MB in the beginning and 166.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 89.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 77.81 ms. Allocated memory is still 205.5 MB. Free memory was 166.2 MB in the beginning and 163.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 70.81 ms. Allocated memory is still 205.5 MB. Free memory was 163.1 MB in the beginning and 161.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 828.38 ms. Allocated memory is still 205.5 MB. Free memory was 160.5 MB in the beginning and 114.3 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 68503.30 ms. Allocated memory was 205.5 MB in the beginning and 247.5 MB in the end (delta: 41.9 MB). Free memory was 113.8 MB in the beginning and 123.4 MB in the end (delta: -9.6 MB). Peak memory consumption was 32.4 MB. Max. memory is 8.0 GB. * Witness Printer took 120.35 ms. Allocated memory is still 247.5 MB. Free memory was 123.4 MB in the beginning and 115.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1366 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 28 SemBasedMoverChecksNegative, 14 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 31.3s, 43 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 47.0s, 135 PlacesBefore, 35 PlacesAfterwards, 137 TransitionsBefore, 34 TransitionsAfterwards, 2060 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 141 TotalNumberOfCompositions, 4079 MoverChecksTotal - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1725] 0 return 0; [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={7:24}, t1={6:0}, t2={9:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={9:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=0, t1={6:0}, t2={9:0}] [L1713] 0 return 0; [L1735] 0 probe_ret = my_drv_probe(&data) [L1736] COND TRUE 0 probe_ret==0 [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=0, t1={6:0}, t2={9:0}] [L1689] 2 struct device *dev = (struct device*)arg; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=0, t1={6:0}, t2={9:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=0, t1={6:0}, t2={9:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=0, t1={6:0}, t2={9:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=0, t1={6:0}, t2={9:0}] [L1738] 0 data.shared.a [L1675] COND FALSE 0 !(!expression) [L1739] 0 data.shared.b [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, lb=0, t1={6:0}, t2={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 68.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.1s, HoareTripleCheckerStatistics: 316 SDtfs, 1035 SDslu, 1410 SDs, 0 SdLazy, 4119 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=2, 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, 16 MinimizatonAttempts, 1209 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 75510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...