/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-507b705 [2020-09-12 00:19:45,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-12 00:19:45,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-12 00:19:45,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-12 00:19:45,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-12 00:19:45,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-12 00:19:45,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-12 00:19:45,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-12 00:19:45,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-12 00:19:46,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-12 00:19:46,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-12 00:19:46,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-12 00:19:46,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-12 00:19:46,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-12 00:19:46,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-12 00:19:46,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-12 00:19:46,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-12 00:19:46,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-12 00:19:46,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-12 00:19:46,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-12 00:19:46,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-12 00:19:46,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-12 00:19:46,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-12 00:19:46,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-12 00:19:46,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-12 00:19:46,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-12 00:19:46,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-12 00:19:46,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-12 00:19:46,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-12 00:19:46,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-12 00:19:46,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-12 00:19:46,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-12 00:19:46,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-12 00:19:46,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-12 00:19:46,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-12 00:19:46,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-12 00:19:46,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-12 00:19:46,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-12 00:19:46,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-12 00:19:46,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-12 00:19:46,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-12 00:19:46,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-09-12 00:19:46,071 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-12 00:19:46,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-12 00:19:46,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-12 00:19:46,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-12 00:19:46,074 INFO L138 SettingsManager]: * Use SBE=true [2020-09-12 00:19:46,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-12 00:19:46,075 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-12 00:19:46,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-12 00:19:46,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-12 00:19:46,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-12 00:19:46,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-12 00:19:46,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-12 00:19:46,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-12 00:19:46,077 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-12 00:19:46,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-12 00:19:46,079 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-12 00:19:46,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-12 00:19:46,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-12 00:19:46,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-12 00:19:46,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-12 00:19:46,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-12 00:19:46,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-12 00:19:46,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-12 00:19:46,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-12 00:19:46,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-12 00:19:46,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-12 00:19:46,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-12 00:19:46,082 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-09-12 00:19:46,082 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-12 00:19:46,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-12 00:19:46,083 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-09-12 00:19:46,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-12 00:19:46,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-12 00:19:46,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-12 00:19:46,567 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-12 00:19:46,567 INFO L275 PluginConnector]: CDTParser initialized [2020-09-12 00:19:46,569 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-09-12 00:19:46,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2b6345de1/8d166ae0463048d4b58ac65a8e2846b8/FLAG7e7b05ef8 [2020-09-12 00:19:47,427 INFO L306 CDTParser]: Found 1 translation units. [2020-09-12 00:19:47,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-09-12 00:19:47,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2b6345de1/8d166ae0463048d4b58ac65a8e2846b8/FLAG7e7b05ef8 [2020-09-12 00:19:47,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2b6345de1/8d166ae0463048d4b58ac65a8e2846b8 [2020-09-12 00:19:47,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-12 00:19:47,602 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-12 00:19:47,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-12 00:19:47,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-12 00:19:47,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-12 00:19:47,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 12:19:47" (1/1) ... [2020-09-12 00:19:47,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615808ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:47, skipping insertion in model container [2020-09-12 00:19:47,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 12:19:47" (1/1) ... [2020-09-12 00:19:47,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-12 00:19:47,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-12 00:19:48,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-12 00:19:48,818 INFO L203 MainTranslator]: Completed pre-run [2020-09-12 00:19:48,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-12 00:19:49,434 INFO L208 MainTranslator]: Completed translation [2020-09-12 00:19:49,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49 WrapperNode [2020-09-12 00:19:49,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-12 00:19:49,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-12 00:19:49,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-12 00:19:49,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-12 00:19:49,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-12 00:19:49,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-12 00:19:49,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-12 00:19:49,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-12 00:19:49,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... [2020-09-12 00:19:49,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-12 00:19:49,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-12 00:19:49,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-12 00:19:49,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-12 00:19:49,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-12 00:19:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-12 00:19:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-12 00:19:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-12 00:19:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-12 00:19:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-12 00:19:49,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-12 00:19:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-12 00:19:49,664 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-12 00:19:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-12 00:19:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-12 00:19:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-12 00:19:49,668 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-12 00:19:50,363 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-12 00:19:50,364 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-12 00:19:50,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 12:19:50 BoogieIcfgContainer [2020-09-12 00:19:50,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-12 00:19:50,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-12 00:19:50,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-12 00:19:50,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-12 00:19:50,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 12:19:47" (1/3) ... [2020-09-12 00:19:50,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2c6093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 12:19:50, skipping insertion in model container [2020-09-12 00:19:50,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:19:49" (2/3) ... [2020-09-12 00:19:50,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2c6093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 12:19:50, skipping insertion in model container [2020-09-12 00:19:50,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 12:19:50" (3/3) ... [2020-09-12 00:19:50,381 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-09-12 00:19:50,393 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-12 00:19:50,393 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-12 00:19:50,404 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-09-12 00:19:50,405 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-12 00:19:50,441 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,441 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,441 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,442 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,442 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,442 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,442 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,444 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,444 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,445 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,445 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,445 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,445 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,446 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,446 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,446 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,447 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,447 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,447 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,447 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,448 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,448 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,448 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,450 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,450 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,450 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,450 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,451 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,451 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,451 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,452 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,452 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,452 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,452 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,453 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,453 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,453 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,453 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,454 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,454 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,454 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,455 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,455 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,455 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,455 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,460 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,460 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,461 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,461 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,461 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,461 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,462 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,462 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,462 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,462 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,473 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,473 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,474 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,474 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,474 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,474 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,475 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,475 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,475 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,475 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:19:50,509 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-12 00:19:50,536 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-12 00:19:50,537 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-12 00:19:50,537 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-12 00:19:50,537 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-09-12 00:19:50,537 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-12 00:19:50,538 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-12 00:19:50,538 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-12 00:19:50,538 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-12 00:19:50,562 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-09-12 00:19:50,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-09-12 00:19:50,704 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-09-12 00:19:50,704 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-12 00:19:50,711 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-12 00:19:50,716 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-09-12 00:19:50,755 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-09-12 00:19:50,756 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-12 00:19:50,757 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-12 00:19:50,761 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2020-09-12 00:19:50,762 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-12 00:19:51,965 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:52,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:19:52,012 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:52,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:19:52,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:52,044 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-09-12 00:19:52,982 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-09-12 00:19:53,840 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:53,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:19:53,870 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:53,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:19:53,889 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:53,890 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-09-12 00:19:54,531 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-09-12 00:19:55,000 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-09-12 00:19:55,154 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-09-12 00:19:55,774 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-09-12 00:19:55,903 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-09-12 00:19:56,373 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-09-12 00:19:56,400 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:56,589 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-09-12 00:19:56,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:19:56,603 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:56,823 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-12 00:19:56,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:19:56,824 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-12 00:19:56,825 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-09-12 00:19:57,029 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-12 00:19:57,220 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-09-12 00:19:58,339 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-09-12 00:19:58,835 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-12 00:19:59,478 WARN L193 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-09-12 00:19:59,828 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-09-12 00:19:59,844 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5194 [2020-09-12 00:19:59,844 INFO L214 etLargeBlockEncoding]: Total number of compositions: 168 [2020-09-12 00:19:59,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-09-12 00:19:59,879 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-09-12 00:19:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-09-12 00:19:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-09-12 00:19:59,891 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:19:59,892 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-09-12 00:19:59,893 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:19:59,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:19:59,901 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-09-12 00:19:59,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:19:59,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665238268] [2020-09-12 00:19:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:00,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665238268] [2020-09-12 00:20:00,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:00,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-09-12 00:20:00,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353510398] [2020-09-12 00:20:00,257 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:00,261 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:00,273 INFO L274 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-09-12 00:20:00,273 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:00,275 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:00,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-12 00:20:00,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:00,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-12 00:20:00,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-12 00:20:00,300 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-09-12 00:20:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:00,353 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-09-12 00:20:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-12 00:20:00,355 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-09-12 00:20:00,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:00,382 INFO L225 Difference]: With dead ends: 386 [2020-09-12 00:20:00,382 INFO L226 Difference]: Without dead ends: 348 [2020-09-12 00:20:00,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-12 00:20:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-09-12 00:20:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-09-12 00:20:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-09-12 00:20:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-09-12 00:20:00,469 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-09-12 00:20:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:00,470 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-09-12 00:20:00,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-12 00:20:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-09-12 00:20:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-12 00:20:00,470 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:00,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-12 00:20:00,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-12 00:20:00,471 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-09-12 00:20:00,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:00,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243862606] [2020-09-12 00:20:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:00,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243862606] [2020-09-12 00:20:00,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-12 00:20:00,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [681987564] [2020-09-12 00:20:00,742 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:00,743 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:00,744 INFO L274 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-09-12 00:20:00,744 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:00,744 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:00,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-12 00:20:00,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-12 00:20:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:00,747 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-09-12 00:20:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:00,877 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-09-12 00:20:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-12 00:20:00,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-12 00:20:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:00,884 INFO L225 Difference]: With dead ends: 471 [2020-09-12 00:20:00,884 INFO L226 Difference]: Without dead ends: 471 [2020-09-12 00:20:00,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-09-12 00:20:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-09-12 00:20:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-09-12 00:20:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-09-12 00:20:00,918 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-09-12 00:20:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:00,919 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-09-12 00:20:00,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-12 00:20:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-09-12 00:20:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-12 00:20:00,920 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:00,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-12 00:20:00,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-12 00:20:00,920 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-09-12 00:20:00,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:00,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326701864] [2020-09-12 00:20:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:01,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326701864] [2020-09-12 00:20:01,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:01,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-12 00:20:01,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776611408] [2020-09-12 00:20:01,058 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:01,058 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:01,059 INFO L274 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-09-12 00:20:01,059 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:01,060 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:01,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-12 00:20:01,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-12 00:20:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:01,061 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-09-12 00:20:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:01,186 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-09-12 00:20:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-12 00:20:01,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-12 00:20:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:01,191 INFO L225 Difference]: With dead ends: 498 [2020-09-12 00:20:01,191 INFO L226 Difference]: Without dead ends: 482 [2020-09-12 00:20:01,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-12 00:20:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-09-12 00:20:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-09-12 00:20:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-09-12 00:20:01,219 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-09-12 00:20:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:01,219 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-09-12 00:20:01,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-12 00:20:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-09-12 00:20:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-12 00:20:01,222 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:01,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:01,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-12 00:20:01,223 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-09-12 00:20:01,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:01,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948867758] [2020-09-12 00:20:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:01,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948867758] [2020-09-12 00:20:01,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:01,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-12 00:20:01,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [404831141] [2020-09-12 00:20:01,408 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:01,410 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:01,413 INFO L274 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-09-12 00:20:01,414 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:01,461 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:01,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-12 00:20:01,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-12 00:20:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:01,462 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-09-12 00:20:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:01,480 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-09-12 00:20:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-12 00:20:01,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-12 00:20:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:01,482 INFO L225 Difference]: With dead ends: 162 [2020-09-12 00:20:01,482 INFO L226 Difference]: Without dead ends: 162 [2020-09-12 00:20:01,483 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-12 00:20:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-09-12 00:20:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-12 00:20:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-09-12 00:20:01,489 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-09-12 00:20:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:01,490 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-09-12 00:20:01,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-12 00:20:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-09-12 00:20:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:01,492 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:01,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:01,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-12 00:20:01,493 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-09-12 00:20:01,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:01,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102631780] [2020-09-12 00:20:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:01,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102631780] [2020-09-12 00:20:01,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:01,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-12 00:20:01,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [803737518] [2020-09-12 00:20:01,749 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:01,758 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:01,817 INFO L274 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-09-12 00:20:01,817 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:01,841 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:01,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:01,844 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-12 00:20:01,844 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2020-09-12 00:20:01,850 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:01,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-12 00:20:01,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-12 00:20:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-12 00:20:01,852 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-09-12 00:20:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:02,044 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-09-12 00:20:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-12 00:20:02,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-09-12 00:20:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:02,046 INFO L225 Difference]: With dead ends: 206 [2020-09-12 00:20:02,046 INFO L226 Difference]: Without dead ends: 206 [2020-09-12 00:20:02,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-12 00:20:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-12 00:20:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-09-12 00:20:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-09-12 00:20:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-09-12 00:20:02,053 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-09-12 00:20:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:02,054 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-09-12 00:20:02,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-12 00:20:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-09-12 00:20:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:02,061 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:02,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:02,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-12 00:20:02,062 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:02,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-09-12 00:20:02,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:02,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188673859] [2020-09-12 00:20:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:03,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188673859] [2020-09-12 00:20:03,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:03,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:03,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002767960] [2020-09-12 00:20:03,152 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:03,161 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:03,172 INFO L274 McrAutomatonBuilder]: Finished intersection with 25 states and 26 transitions. [2020-09-12 00:20:03,173 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:03,203 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:03,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:03,211 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:03,212 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:03,218 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:03,219 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:03,224 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:03,226 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:03,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:03,236 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-09-12 00:20:03,236 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:69, output treesize:25 [2020-09-12 00:20:03,267 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5807#(and (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= (select (store (select |#memory_int| ~my_dev~0.base) ~my_dev~0.offset 1) (+ ~my_dev~0.offset 4)) 0) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|))] [2020-09-12 00:20:03,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-12 00:20:03,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-12 00:20:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-09-12 00:20:03,269 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 13 states. [2020-09-12 00:20:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:04,947 INFO L93 Difference]: Finished difference Result 304 states and 586 transitions. [2020-09-12 00:20:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-12 00:20:04,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-09-12 00:20:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:04,951 INFO L225 Difference]: With dead ends: 304 [2020-09-12 00:20:04,951 INFO L226 Difference]: Without dead ends: 304 [2020-09-12 00:20:04,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2020-09-12 00:20:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-12 00:20:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 243. [2020-09-12 00:20:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-09-12 00:20:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 484 transitions. [2020-09-12 00:20:04,961 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 484 transitions. Word has length 22 [2020-09-12 00:20:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:04,962 INFO L479 AbstractCegarLoop]: Abstraction has 243 states and 484 transitions. [2020-09-12 00:20:04,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-12 00:20:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 484 transitions. [2020-09-12 00:20:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:04,963 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:04,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:04,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-12 00:20:04,964 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-09-12 00:20:04,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:04,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605769413] [2020-09-12 00:20:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:05,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605769413] [2020-09-12 00:20:05,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:05,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-12 00:20:05,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802259137] [2020-09-12 00:20:05,484 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:05,490 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:05,499 INFO L274 McrAutomatonBuilder]: Finished intersection with 25 states and 26 transitions. [2020-09-12 00:20:05,500 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:05,511 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:05,512 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:05,516 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:05,517 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:05,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:05,523 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:05,526 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:05,527 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:05,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:05,535 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-09-12 00:20:05,536 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:60, output treesize:16 [2020-09-12 00:20:05,536 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:05,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-12 00:20:05,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-12 00:20:05,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-12 00:20:05,537 INFO L87 Difference]: Start difference. First operand 243 states and 484 transitions. Second operand 8 states. [2020-09-12 00:20:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:05,924 INFO L93 Difference]: Finished difference Result 364 states and 688 transitions. [2020-09-12 00:20:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-12 00:20:05,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-12 00:20:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:05,927 INFO L225 Difference]: With dead ends: 364 [2020-09-12 00:20:05,927 INFO L226 Difference]: Without dead ends: 314 [2020-09-12 00:20:05,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-09-12 00:20:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-09-12 00:20:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2020-09-12 00:20:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-09-12 00:20:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 482 transitions. [2020-09-12 00:20:05,935 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 482 transitions. Word has length 22 [2020-09-12 00:20:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:05,936 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 482 transitions. [2020-09-12 00:20:05,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-12 00:20:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 482 transitions. [2020-09-12 00:20:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:05,937 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:05,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:05,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-12 00:20:05,938 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-09-12 00:20:05,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:05,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355836702] [2020-09-12 00:20:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:06,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355836702] [2020-09-12 00:20:06,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:06,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-12 00:20:06,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101522732] [2020-09-12 00:20:06,155 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:06,161 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:06,172 INFO L274 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2020-09-12 00:20:06,172 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:06,231 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7486#(not (= (select (select |#pthreadsMutex| ~my_dev~0.base) (+ ~my_dev~0.offset (- 24))) 0)), 7487#(or (and (<= 24 ~my_dev~0.offset) (<= ~my_dev~0.offset 24)) (not (= (select (select |#pthreadsMutex| ~my_dev~0.base) (+ ~my_dev~0.offset (- 24))) 0)))] [2020-09-12 00:20:06,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-12 00:20:06,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-12 00:20:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-12 00:20:06,232 INFO L87 Difference]: Start difference. First operand 242 states and 482 transitions. Second operand 6 states. [2020-09-12 00:20:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:06,269 INFO L93 Difference]: Finished difference Result 152 states and 249 transitions. [2020-09-12 00:20:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-12 00:20:06,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-09-12 00:20:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:06,271 INFO L225 Difference]: With dead ends: 152 [2020-09-12 00:20:06,271 INFO L226 Difference]: Without dead ends: 147 [2020-09-12 00:20:06,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-12 00:20:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-09-12 00:20:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2020-09-12 00:20:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-09-12 00:20:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 242 transitions. [2020-09-12 00:20:06,276 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 242 transitions. Word has length 22 [2020-09-12 00:20:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:06,276 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 242 transitions. [2020-09-12 00:20:06,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-12 00:20:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 242 transitions. [2020-09-12 00:20:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:06,277 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:06,277 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:06,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-12 00:20:06,278 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-09-12 00:20:06,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:06,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851025181] [2020-09-12 00:20:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:06,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851025181] [2020-09-12 00:20:06,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:06,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-12 00:20:06,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1953960583] [2020-09-12 00:20:06,736 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:06,742 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:06,753 INFO L274 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-09-12 00:20:06,753 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:06,768 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:06,789 INFO L625 ElimStorePlain]: treesize reduction 39, result has 43.5 percent of original size [2020-09-12 00:20:06,789 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_76| vanished before elimination [2020-09-12 00:20:06,790 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:06,790 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:06,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-09-12 00:20:06,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:89, output treesize:30 [2020-09-12 00:20:06,795 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:06,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:06,798 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-12 00:20:06,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2020-09-12 00:20:06,800 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:06,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-12 00:20:06,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-12 00:20:06,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-12 00:20:06,801 INFO L87 Difference]: Start difference. First operand 146 states and 242 transitions. Second operand 8 states. [2020-09-12 00:20:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:07,240 INFO L93 Difference]: Finished difference Result 167 states and 273 transitions. [2020-09-12 00:20:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-12 00:20:07,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-12 00:20:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:07,242 INFO L225 Difference]: With dead ends: 167 [2020-09-12 00:20:07,243 INFO L226 Difference]: Without dead ends: 167 [2020-09-12 00:20:07,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-12 00:20:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-09-12 00:20:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2020-09-12 00:20:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-12 00:20:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 249 transitions. [2020-09-12 00:20:07,248 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 249 transitions. Word has length 22 [2020-09-12 00:20:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:07,248 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 249 transitions. [2020-09-12 00:20:07,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-12 00:20:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 249 transitions. [2020-09-12 00:20:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:07,249 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:07,249 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:07,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-12 00:20:07,250 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-09-12 00:20:07,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:07,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128373082] [2020-09-12 00:20:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:08,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128373082] [2020-09-12 00:20:08,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:08,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:08,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487043575] [2020-09-12 00:20:08,013 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:08,019 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:08,028 INFO L274 McrAutomatonBuilder]: Finished intersection with 27 states and 30 transitions. [2020-09-12 00:20:08,028 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:08,052 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:08,061 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:08,066 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:08,069 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:08,070 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:08,072 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:08,120 INFO L625 ElimStorePlain]: treesize reduction 161, result has 18.3 percent of original size [2020-09-12 00:20:08,121 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:08,121 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:08,121 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_78| vanished before elimination [2020-09-12 00:20:08,121 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:08,122 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:317, output treesize:36 [2020-09-12 00:20:08,155 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8433#(and (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 0) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|))] [2020-09-12 00:20:08,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-12 00:20:08,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:08,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-12 00:20:08,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-09-12 00:20:08,157 INFO L87 Difference]: Start difference. First operand 153 states and 249 transitions. Second operand 13 states. [2020-09-12 00:20:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:08,983 INFO L93 Difference]: Finished difference Result 158 states and 253 transitions. [2020-09-12 00:20:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-12 00:20:08,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-09-12 00:20:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:08,984 INFO L225 Difference]: With dead ends: 158 [2020-09-12 00:20:08,984 INFO L226 Difference]: Without dead ends: 145 [2020-09-12 00:20:08,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-09-12 00:20:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-12 00:20:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-09-12 00:20:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-12 00:20:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 240 transitions. [2020-09-12 00:20:08,988 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 240 transitions. Word has length 22 [2020-09-12 00:20:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:08,988 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 240 transitions. [2020-09-12 00:20:08,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-12 00:20:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 240 transitions. [2020-09-12 00:20:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:08,989 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:08,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:08,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-12 00:20:08,990 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1716865024, now seen corresponding path program 3 times [2020-09-12 00:20:08,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:08,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303382025] [2020-09-12 00:20:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:09,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303382025] [2020-09-12 00:20:09,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:09,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-12 00:20:09,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264334398] [2020-09-12 00:20:09,415 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:09,421 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:09,433 INFO L274 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-09-12 00:20:09,434 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:09,438 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:09,440 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2020-09-12 00:20:09,455 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:09,455 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:09,511 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:8 [2020-09-12 00:20:09,535 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:09,535 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:09,558 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_80| vanished before elimination [2020-09-12 00:20:09,558 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:09,558 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_80| vanished before elimination [2020-09-12 00:20:09,559 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:20:09,559 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:102, output treesize:41 [2020-09-12 00:20:09,605 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,607 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,612 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:09,677 INFO L625 ElimStorePlain]: treesize reduction 101, result has 28.9 percent of original size [2020-09-12 00:20:09,677 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:09,677 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:09,677 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_81| vanished before elimination [2020-09-12 00:20:09,678 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:20:09,678 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:202, output treesize:41 [2020-09-12 00:20:09,693 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:09,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-12 00:20:09,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-12 00:20:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-12 00:20:09,694 INFO L87 Difference]: Start difference. First operand 145 states and 240 transitions. Second operand 8 states. [2020-09-12 00:20:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:10,163 INFO L93 Difference]: Finished difference Result 140 states and 226 transitions. [2020-09-12 00:20:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-12 00:20:10,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-12 00:20:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:10,165 INFO L225 Difference]: With dead ends: 140 [2020-09-12 00:20:10,165 INFO L226 Difference]: Without dead ends: 140 [2020-09-12 00:20:10,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-12 00:20:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-09-12 00:20:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2020-09-12 00:20:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-09-12 00:20:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 203 transitions. [2020-09-12 00:20:10,170 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 203 transitions. Word has length 22 [2020-09-12 00:20:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:10,170 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 203 transitions. [2020-09-12 00:20:10,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-12 00:20:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 203 transitions. [2020-09-12 00:20:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:10,171 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:10,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:10,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-12 00:20:10,172 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-09-12 00:20:10,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:10,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933960874] [2020-09-12 00:20:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:10,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933960874] [2020-09-12 00:20:10,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:10,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:10,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569238026] [2020-09-12 00:20:10,985 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:10,990 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:10,999 INFO L274 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-09-12 00:20:10,999 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:11,010 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-09-12 00:20:11,201 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-09-12 00:20:11,280 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:11,280 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,285 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:11,285 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,289 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:11,290 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,293 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:11,294 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,297 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:11,297 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,308 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:11,309 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:11,309 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:164, output treesize:32 [2020-09-12 00:20:11,319 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,320 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,324 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,328 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,329 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,379 INFO L625 ElimStorePlain]: treesize reduction 160, result has 13.5 percent of original size [2020-09-12 00:20:11,379 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:11,379 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:11,379 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_82| vanished before elimination [2020-09-12 00:20:11,380 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:11,380 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:285, output treesize:25 [2020-09-12 00:20:11,396 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,398 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,399 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,400 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,402 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,403 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:11,464 INFO L625 ElimStorePlain]: treesize reduction 161, result has 18.3 percent of original size [2020-09-12 00:20:11,464 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_83| vanished before elimination [2020-09-12 00:20:11,465 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:11,465 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:11,465 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:11,466 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:317, output treesize:36 [2020-09-12 00:20:11,473 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9318#(and (or (<= 1 (select (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28))) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| 0)))) (or (= |ULTIMATE.start_main_~#data~1.offset| my_callbackThread1of1ForFork0_~data~0.offset) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| 0)))) (or (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork0_~data~0.base) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| 0)))) (or (<= (select (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| 0)))) (or (= my_callbackThread1of1ForFork0_~data~0.base 0) (not (= (select |#valid| my_callbackThread1of1ForFork0_~data~0.base) 0))))] [2020-09-12 00:20:11,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-12 00:20:11,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-12 00:20:11,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-09-12 00:20:11,475 INFO L87 Difference]: Start difference. First operand 127 states and 203 transitions. Second operand 13 states. [2020-09-12 00:20:12,113 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-09-12 00:20:12,369 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-09-12 00:20:12,652 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2020-09-12 00:20:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:12,814 INFO L93 Difference]: Finished difference Result 146 states and 227 transitions. [2020-09-12 00:20:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-12 00:20:12,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-09-12 00:20:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:12,816 INFO L225 Difference]: With dead ends: 146 [2020-09-12 00:20:12,816 INFO L226 Difference]: Without dead ends: 134 [2020-09-12 00:20:12,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-12 00:20:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-09-12 00:20:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-09-12 00:20:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-12 00:20:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 214 transitions. [2020-09-12 00:20:12,820 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 214 transitions. Word has length 22 [2020-09-12 00:20:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:12,821 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 214 transitions. [2020-09-12 00:20:12,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-12 00:20:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 214 transitions. [2020-09-12 00:20:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:12,822 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:12,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:12,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-12 00:20:12,822 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-09-12 00:20:12,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:12,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24869362] [2020-09-12 00:20:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:13,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24869362] [2020-09-12 00:20:13,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:13,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-12 00:20:13,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1506949174] [2020-09-12 00:20:13,301 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:13,309 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:13,323 INFO L274 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-09-12 00:20:13,323 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:13,334 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:13,335 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:13,339 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:13,340 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:13,345 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:13,346 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:13,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:13,354 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:20:13,354 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:13 [2020-09-12 00:20:13,395 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:13,395 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:13,398 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:13,399 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:13,400 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:13,400 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:13,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:13,408 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:20:13,408 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:60, output treesize:14 [2020-09-12 00:20:13,424 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9755#(and (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| ~my_dev~0.base)) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|))] [2020-09-12 00:20:13,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-12 00:20:13,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-12 00:20:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-12 00:20:13,425 INFO L87 Difference]: Start difference. First operand 133 states and 214 transitions. Second operand 9 states. [2020-09-12 00:20:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:13,785 INFO L93 Difference]: Finished difference Result 144 states and 225 transitions. [2020-09-12 00:20:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-12 00:20:13,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-12 00:20:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:13,787 INFO L225 Difference]: With dead ends: 144 [2020-09-12 00:20:13,787 INFO L226 Difference]: Without dead ends: 118 [2020-09-12 00:20:13,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-09-12 00:20:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-12 00:20:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-09-12 00:20:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-09-12 00:20:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 188 transitions. [2020-09-12 00:20:13,793 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 188 transitions. Word has length 22 [2020-09-12 00:20:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:13,793 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 188 transitions. [2020-09-12 00:20:13,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-12 00:20:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 188 transitions. [2020-09-12 00:20:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:13,794 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:13,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:13,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-12 00:20:13,794 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 4 times [2020-09-12 00:20:13,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:13,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121966852] [2020-09-12 00:20:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:14,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121966852] [2020-09-12 00:20:14,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:14,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-12 00:20:14,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [948009573] [2020-09-12 00:20:14,827 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:14,830 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:14,842 INFO L274 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2020-09-12 00:20:14,842 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:14,853 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:14,862 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:14,863 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:14,863 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:16 [2020-09-12 00:20:16,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_55 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (not (= c_my_callbackThread1of1ForFork0_thidvar0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_55)) |c_~#t2~0.base|) |c_~#t2~0.offset|)))) is different from false [2020-09-12 00:20:17,755 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-09-12 00:20:17,763 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,768 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,772 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,830 INFO L625 ElimStorePlain]: treesize reduction 168, result has 20.8 percent of original size [2020-09-12 00:20:17,830 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_87| vanished before elimination [2020-09-12 00:20:17,830 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:17,830 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:17,831 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:17,831 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:272, output treesize:44 [2020-09-12 00:20:17,848 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-09-12 00:20:17,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-09-12 00:20:17,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,863 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,864 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,867 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,868 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,933 INFO L625 ElimStorePlain]: treesize reduction 165, result has 21.1 percent of original size [2020-09-12 00:20:17,933 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_88| vanished before elimination [2020-09-12 00:20:17,933 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:17,934 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:17,934 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:17,934 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:309, output treesize:44 [2020-09-12 00:20:17,958 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:17,958 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,962 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:17,962 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,964 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:17,964 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,965 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:17,966 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,970 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:17,970 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:17,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:17,993 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:17,993 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:141, output treesize:46 [2020-09-12 00:20:18,010 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-09-12 00:20:18,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-09-12 00:20:18,034 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,038 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,041 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,044 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,046 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,149 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2020-09-12 00:20:18,149 INFO L625 ElimStorePlain]: treesize reduction 180, result has 25.6 percent of original size [2020-09-12 00:20:18,149 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:18,149 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:18,149 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_89| vanished before elimination [2020-09-12 00:20:18,150 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:18,150 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:342, output treesize:62 [2020-09-12 00:20:18,173 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-09-12 00:20:18,178 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-09-12 00:20:18,203 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,203 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,209 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,209 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,215 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,215 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,222 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,222 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,224 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,224 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,229 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,229 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,234 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,235 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,236 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:18,236 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,304 INFO L625 ElimStorePlain]: treesize reduction 9, result has 87.3 percent of original size [2020-09-12 00:20:18,304 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_90| vanished before elimination [2020-09-12 00:20:18,304 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:18,305 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_90| vanished before elimination [2020-09-12 00:20:18,305 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:18,305 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:483, output treesize:62 [2020-09-12 00:20:18,316 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [10160#(forall ((v_DerPreprocessor_55 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (not (= my_callbackThread1of1ForFork0_thidvar0 (select (select (store |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_55)) |~#t2~0.base|) |~#t2~0.offset|)))), 10161#(or (forall ((v_DerPreprocessor_55 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (not (= my_callbackThread1of1ForFork0_thidvar0 (select (select (store |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_55)) |~#t2~0.base|) |~#t2~0.offset|)))) (not (= my_callbackThread1of1ForFork1_thidvar0 |ULTIMATE.start_my_drv_disconnect_#t~mem37|))), 10162#(or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_38| Int) (v_DerPreprocessor_55 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (or (not (= (select (select (store |#memory_int| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_38| (store (select |#memory_int| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_38|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_55)) |~#t2~0.base|) |~#t2~0.offset|) my_callbackThread1of1ForFork0_thidvar0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_38| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_38|) 0)))) (not (= my_callbackThread1of1ForFork1_thidvar0 (select (select |#memory_int| |~#t1~0.base|) |~#t1~0.offset|))))] [2020-09-12 00:20:18,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-12 00:20:18,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-12 00:20:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=191, Unknown=2, NotChecked=28, Total=272 [2020-09-12 00:20:18,317 INFO L87 Difference]: Start difference. First operand 118 states and 188 transitions. Second operand 17 states. [2020-09-12 00:20:18,734 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-09-12 00:20:19,887 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-09-12 00:20:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:20,309 INFO L93 Difference]: Finished difference Result 176 states and 282 transitions. [2020-09-12 00:20:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-12 00:20:20,310 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-09-12 00:20:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:20,312 INFO L225 Difference]: With dead ends: 176 [2020-09-12 00:20:20,312 INFO L226 Difference]: Without dead ends: 167 [2020-09-12 00:20:20,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=242, Invalid=752, Unknown=2, NotChecked=60, Total=1056 [2020-09-12 00:20:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-09-12 00:20:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 119. [2020-09-12 00:20:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-12 00:20:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 188 transitions. [2020-09-12 00:20:20,317 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 188 transitions. Word has length 22 [2020-09-12 00:20:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:20,317 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 188 transitions. [2020-09-12 00:20:20,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-12 00:20:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 188 transitions. [2020-09-12 00:20:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:20,318 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:20,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:20,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-12 00:20:20,319 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 5 times [2020-09-12 00:20:20,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:20,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946568467] [2020-09-12 00:20:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:21,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946568467] [2020-09-12 00:20:21,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:21,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:21,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153108466] [2020-09-12 00:20:21,094 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:21,097 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:21,105 INFO L274 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-09-12 00:20:21,105 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:21,117 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-09-12 00:20:21,277 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,278 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,281 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,281 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,284 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,285 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:21,293 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_91| vanished before elimination [2020-09-12 00:20:21,293 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:21,294 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_91| vanished before elimination [2020-09-12 00:20:21,294 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:21,294 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:188, output treesize:18 [2020-09-12 00:20:21,316 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,317 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,318 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,319 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,320 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,375 INFO L625 ElimStorePlain]: treesize reduction 144, result has 21.7 percent of original size [2020-09-12 00:20:21,375 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:21,375 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:21,376 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_92| vanished before elimination [2020-09-12 00:20:21,376 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:21,376 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:284, output treesize:40 [2020-09-12 00:20:21,392 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,392 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,398 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,398 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,401 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,402 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,407 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,408 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,409 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:21,409 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:21,424 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:21,424 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:124, output treesize:32 [2020-09-12 00:20:21,442 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,443 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,446 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,448 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,451 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,501 INFO L625 ElimStorePlain]: treesize reduction 160, result has 14.9 percent of original size [2020-09-12 00:20:21,501 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:21,501 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:21,502 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_93| vanished before elimination [2020-09-12 00:20:21,502 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:21,502 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:288, output treesize:28 [2020-09-12 00:20:21,537 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,540 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,541 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,542 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,545 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,546 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,547 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:21,604 INFO L625 ElimStorePlain]: treesize reduction 185, result has 17.4 percent of original size [2020-09-12 00:20:21,605 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_94| vanished before elimination [2020-09-12 00:20:21,605 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:21,605 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:21,605 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:21,606 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:364, output treesize:39 [2020-09-12 00:20:21,606 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10622#(and (or (not (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 0)) (= |ULTIMATE.start_main_~#data~1.base| 0)) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_39| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_39|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_39| 0))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2)) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_39| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_39|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_39| 0))) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)))))] [2020-09-12 00:20:21,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-12 00:20:21,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-12 00:20:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-09-12 00:20:21,607 INFO L87 Difference]: Start difference. First operand 119 states and 188 transitions. Second operand 13 states. [2020-09-12 00:20:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:22,389 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2020-09-12 00:20:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-12 00:20:22,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-09-12 00:20:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:22,392 INFO L225 Difference]: With dead ends: 129 [2020-09-12 00:20:22,392 INFO L226 Difference]: Without dead ends: 118 [2020-09-12 00:20:22,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2020-09-12 00:20:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-12 00:20:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2020-09-12 00:20:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-12 00:20:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2020-09-12 00:20:22,396 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 22 [2020-09-12 00:20:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:22,396 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2020-09-12 00:20:22,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-12 00:20:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2020-09-12 00:20:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:22,397 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:22,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:22,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-12 00:20:22,398 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:22,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1633571078, now seen corresponding path program 5 times [2020-09-12 00:20:22,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:22,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975698357] [2020-09-12 00:20:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:23,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975698357] [2020-09-12 00:20:23,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:23,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-12 00:20:23,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1008217282] [2020-09-12 00:20:23,115 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:23,119 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:23,130 INFO L274 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2020-09-12 00:20:23,131 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:23,137 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-09-12 00:20:23,157 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,158 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,161 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,165 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,167 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,231 INFO L625 ElimStorePlain]: treesize reduction 244, result has 16.2 percent of original size [2020-09-12 00:20:23,232 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_95| vanished before elimination [2020-09-12 00:20:23,232 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:23,232 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:23,233 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:23,233 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:391, output treesize:47 [2020-09-12 00:20:23,266 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:23,267 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,272 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:23,272 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,274 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:23,274 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,278 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:23,278 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,280 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:23,280 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:23,305 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:23,305 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:135, output treesize:38 [2020-09-12 00:20:23,313 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-09-12 00:20:23,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,333 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,335 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,336 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,339 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,455 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-09-12 00:20:23,456 INFO L625 ElimStorePlain]: treesize reduction 164, result has 24.8 percent of original size [2020-09-12 00:20:23,456 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_96| vanished before elimination [2020-09-12 00:20:23,456 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:23,457 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:23,457 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:23,457 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:318, output treesize:54 [2020-09-12 00:20:23,463 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 3 conjuncts [2020-09-12 00:20:23,477 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,478 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,481 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,482 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,486 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,487 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,490 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,578 INFO L625 ElimStorePlain]: treesize reduction 216, result has 20.0 percent of original size [2020-09-12 00:20:23,579 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_97| vanished before elimination [2020-09-12 00:20:23,579 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:23,579 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:23,579 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:23,580 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:410, output treesize:54 [2020-09-12 00:20:23,586 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:23,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:23,589 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:23,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:16 [2020-09-12 00:20:24,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_103 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_103)) |c_~#t2~0.base|) |c_~#t2~0.offset|) c_my_callbackThread1of1ForFork0_thidvar0))) is different from false [2020-09-12 00:20:26,425 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 20 [2020-09-12 00:20:35,715 WARN L193 SmtUtils]: Spent 7.82 s on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2020-09-12 00:20:35,728 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [11005#(forall ((v_DerPreprocessor_103 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_103)) |~#t2~0.base|) |~#t2~0.offset|) my_callbackThread1of1ForFork0_thidvar0))), 11006#(or (forall ((v_DerPreprocessor_103 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_103)) |~#t2~0.base|) |~#t2~0.offset|) my_callbackThread1of1ForFork0_thidvar0))) (not (= my_callbackThread1of1ForFork1_thidvar0 |ULTIMATE.start_my_drv_disconnect_#t~mem37|))), 11007#(and (or (not (= my_callbackThread1of1ForFork1_thidvar0 |ULTIMATE.start_my_drv_disconnect_#t~mem37|)) (not (= |~#t2~0.base| |ULTIMATE.start_my_drv_disconnect_~#status~0.base|))) (or (forall ((v_DerPreprocessor_103 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |#memory_int| |ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_103)) |~#t2~0.base|) |~#t2~0.offset|) my_callbackThread1of1ForFork0_thidvar0))) (not (= my_callbackThread1of1ForFork1_thidvar0 |ULTIMATE.start_my_drv_disconnect_#t~mem37|))))] [2020-09-12 00:20:35,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-12 00:20:35,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:35,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-12 00:20:35,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=221, Unknown=2, NotChecked=30, Total=306 [2020-09-12 00:20:35,729 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 18 states. [2020-09-12 00:20:37,021 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-09-12 00:20:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:37,417 INFO L93 Difference]: Finished difference Result 148 states and 238 transitions. [2020-09-12 00:20:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-12 00:20:37,418 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2020-09-12 00:20:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:37,419 INFO L225 Difference]: With dead ends: 148 [2020-09-12 00:20:37,420 INFO L226 Difference]: Without dead ends: 140 [2020-09-12 00:20:37,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=214, Invalid=718, Unknown=2, NotChecked=58, Total=992 [2020-09-12 00:20:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-09-12 00:20:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2020-09-12 00:20:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-12 00:20:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 164 transitions. [2020-09-12 00:20:37,426 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 164 transitions. Word has length 22 [2020-09-12 00:20:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:37,426 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 164 transitions. [2020-09-12 00:20:37,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-12 00:20:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 164 transitions. [2020-09-12 00:20:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:37,427 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:37,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:37,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-12 00:20:37,430 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 6 times [2020-09-12 00:20:37,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:37,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035542603] [2020-09-12 00:20:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:38,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035542603] [2020-09-12 00:20:38,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:38,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:38,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123910274] [2020-09-12 00:20:38,337 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:38,340 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:38,348 INFO L274 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-09-12 00:20:38,348 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:38,382 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,383 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,384 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,385 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,388 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,443 INFO L625 ElimStorePlain]: treesize reduction 144, result has 21.7 percent of original size [2020-09-12 00:20:38,444 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_99| vanished before elimination [2020-09-12 00:20:38,444 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:38,444 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:38,444 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:38,445 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:284, output treesize:40 [2020-09-12 00:20:38,451 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,451 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,455 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,455 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,458 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,458 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,462 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,463 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,465 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,465 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:38,478 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:38,479 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:124, output treesize:32 [2020-09-12 00:20:38,512 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,512 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,514 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,514 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,515 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,516 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,522 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,522 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,529 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,529 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:38,551 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:38,551 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_100| vanished before elimination [2020-09-12 00:20:38,551 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_100| vanished before elimination [2020-09-12 00:20:38,551 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:38,551 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:288, output treesize:28 [2020-09-12 00:20:38,569 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,570 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,571 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,572 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,573 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,573 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,575 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,575 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,577 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,577 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,578 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,579 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,580 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:38,581 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:38,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:38,597 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:38,597 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_101| vanished before elimination [2020-09-12 00:20:38,597 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_101| vanished before elimination [2020-09-12 00:20:38,598 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:38,598 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:364, output treesize:39 [2020-09-12 00:20:38,627 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11407#(and (<= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork0_~data~0.base) (= |ULTIMATE.start_main_~#data~1.offset| my_callbackThread1of1ForFork0_~data~0.offset) (<= 1 (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28))) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork0_~data~0.base)))] [2020-09-12 00:20:38,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-12 00:20:38,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-12 00:20:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-09-12 00:20:38,629 INFO L87 Difference]: Start difference. First operand 105 states and 164 transitions. Second operand 13 states. [2020-09-12 00:20:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:39,495 INFO L93 Difference]: Finished difference Result 105 states and 163 transitions. [2020-09-12 00:20:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-12 00:20:39,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-09-12 00:20:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:39,501 INFO L225 Difference]: With dead ends: 105 [2020-09-12 00:20:39,501 INFO L226 Difference]: Without dead ends: 81 [2020-09-12 00:20:39,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-09-12 00:20:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-12 00:20:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-09-12 00:20:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-12 00:20:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 131 transitions. [2020-09-12 00:20:39,505 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 131 transitions. Word has length 22 [2020-09-12 00:20:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:39,505 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 131 transitions. [2020-09-12 00:20:39,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-12 00:20:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 131 transitions. [2020-09-12 00:20:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:20:39,506 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:39,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:39,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-12 00:20:39,507 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:20:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 7 times [2020-09-12 00:20:39,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:39,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821488012] [2020-09-12 00:20:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:40,138 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-09-12 00:20:40,300 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2020-09-12 00:20:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:40,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821488012] [2020-09-12 00:20:40,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:40,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:40,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2008034038] [2020-09-12 00:20:40,638 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:40,641 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:40,648 INFO L274 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-09-12 00:20:40,648 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:40,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,665 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,670 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,671 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,690 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,695 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,695 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,703 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,703 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,708 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,709 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:40,722 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:40,722 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:100, output treesize:34 [2020-09-12 00:20:40,744 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:40,744 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,749 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:40,750 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,752 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:40,752 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,756 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:40,756 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,761 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:40,761 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,765 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:40,766 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:40,785 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:20:40,785 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:130, output treesize:31 [2020-09-12 00:20:40,791 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-09-12 00:20:40,802 INFO L441 ElimStorePlain]: Different costs {0=[|#pthreadsMutex|], 2=[|v_#memory_int_155|]} [2020-09-12 00:20:40,809 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,810 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,817 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,818 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,831 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,831 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,839 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,845 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,846 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,852 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:20:40,852 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:40,942 INFO L625 ElimStorePlain]: treesize reduction 149, result has 18.6 percent of original size [2020-09-12 00:20:40,942 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_155| vanished before elimination [2020-09-12 00:20:40,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:40,943 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:249, output treesize:34 [2020-09-12 00:20:40,963 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 3 conjuncts [2020-09-12 00:20:41,143 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-09-12 00:20:41,276 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 3 conjuncts [2020-09-12 00:20:41,314 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,314 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,326 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,326 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,337 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,337 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,349 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,357 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,358 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,373 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,373 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,381 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,382 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,391 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,392 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,401 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,401 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,522 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-09-12 00:20:41,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:41,523 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_103| vanished before elimination [2020-09-12 00:20:41,533 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,533 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,544 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,555 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,556 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,565 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,565 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,575 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,575 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,596 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,597 INFO L545 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,605 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,605 INFO L545 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,615 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,616 INFO L545 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,629 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:20:41,629 INFO L545 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:41,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:41,712 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_103| vanished before elimination [2020-09-12 00:20:41,717 INFO L545 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2020-09-12 00:20:41,717 INFO L244 ElimStorePlain]: Needed 19 recursive calls to eliminate 13 variables, input treesize:424, output treesize:136 [2020-09-12 00:21:01,371 WARN L193 SmtUtils]: Spent 19.59 s on a formula simplification that was a NOOP. DAG size: 102 [2020-09-12 00:21:01,372 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [11699#(and (or (= (select (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (<= ~my_dev~0.offset 24) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0)))) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1))) (or (<= 24 ~my_dev~0.offset) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (= |ULTIMATE.start_main_~#data~1.offset| 0) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (= my_callbackThread1of1ForFork0_~data~0.base 0) (not (= (select |#valid| my_callbackThread1of1ForFork0_~data~0.base) 0)))), 11700#(and (or (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (forall ((v_prenex_28 Int)) (or (not (= (select |#valid| v_prenex_28) 0)) (= v_prenex_28 0)))) (or (<= ~my_dev~0.offset 24) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_40|) 0))))) (or (forall ((v_prenex_27 Int)) (or (not (= (select |#valid| v_prenex_27) 0)) (= v_prenex_27 0))) (<= 24 ~my_dev~0.offset)) (or (forall ((v_prenex_23 Int)) (or (not (= (select |#valid| v_prenex_23) 0)) (= v_prenex_23 0))) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)) (or (= |ULTIMATE.start_main_~#data~1.offset| 0) (forall ((v_prenex_29 Int)) (or (= v_prenex_29 0) (not (= (select |#valid| v_prenex_29) 0))))) (or (forall ((v_prenex_24 Int)) (or (not (= (select |#valid| v_prenex_24) 0)) (= v_prenex_24 0))) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|)) (or (forall ((v_prenex_25 Int)) (or (not (= (select |#valid| v_prenex_25) 0)) (= v_prenex_25 0))) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1))) (or (forall ((v_prenex_26 Int)) (or (= v_prenex_26 0) (not (= (select |#valid| v_prenex_26) 0)))) (forall ((|~#t2~0.offset| Int)) (= (select (store (select (store |#memory_int| |~#t2~0.base| (store (select |#memory_int| |~#t2~0.base|) |~#t2~0.offset| 1)) my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0))) (or (= my_callbackThread1of1ForFork0_~data~0.base 0) (not (= (select |#valid| my_callbackThread1of1ForFork0_~data~0.base) 0))))] [2020-09-12 00:21:01,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-12 00:21:01,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:21:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-12 00:21:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-12 00:21:01,374 INFO L87 Difference]: Start difference. First operand 81 states and 131 transitions. Second operand 14 states. [2020-09-12 00:21:01,694 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 53 [2020-09-12 00:21:06,196 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 35 [2020-09-12 00:21:08,039 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 53 [2020-09-12 00:21:08,226 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2020-09-12 00:21:08,461 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 37 [2020-09-12 00:21:08,735 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 55 [2020-09-12 00:21:08,930 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2020-09-12 00:21:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:21:09,446 INFO L93 Difference]: Finished difference Result 122 states and 193 transitions. [2020-09-12 00:21:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-12 00:21:09,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-12 00:21:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:21:09,448 INFO L225 Difference]: With dead ends: 122 [2020-09-12 00:21:09,449 INFO L226 Difference]: Without dead ends: 122 [2020-09-12 00:21:09,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2020-09-12 00:21:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-09-12 00:21:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2020-09-12 00:21:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-09-12 00:21:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 178 transitions. [2020-09-12 00:21:09,454 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 178 transitions. Word has length 22 [2020-09-12 00:21:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:21:09,454 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 178 transitions. [2020-09-12 00:21:09,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-12 00:21:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 178 transitions. [2020-09-12 00:21:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:21:09,455 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:21:09,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:21:09,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-12 00:21:09,456 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:21:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:21:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 3 times [2020-09-12 00:21:09,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:21:09,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890389783] [2020-09-12 00:21:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:21:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:21:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:21:09,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890389783] [2020-09-12 00:21:09,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:21:09,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-12 00:21:09,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175411208] [2020-09-12 00:21:09,980 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:21:09,984 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:21:09,994 INFO L274 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-09-12 00:21:09,994 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:21:10,003 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:10,004 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,009 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:10,011 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:10,016 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,019 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:10,020 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:10,028 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-09-12 00:21:10,028 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:60, output treesize:16 [2020-09-12 00:21:10,040 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:10,040 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,045 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:10,045 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,049 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:10,049 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,050 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:10,051 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:10,062 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:21:10,063 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:76, output treesize:17 [2020-09-12 00:21:10,073 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,076 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,081 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,085 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,088 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:10,120 INFO L625 ElimStorePlain]: treesize reduction 59, result has 22.4 percent of original size [2020-09-12 00:21:10,121 INFO L513 ElimStorePlain]: Eliminatee |#pthreadsMutex| vanished before elimination [2020-09-12 00:21:10,121 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:21:10,121 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:161, output treesize:17 [2020-09-12 00:21:10,123 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-09-12 00:21:10,346 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12077#(and (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41|) 0)))) (<= 24 ~my_dev~0.offset)) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41|) 0)))) (<= ~my_dev~0.offset 24)) (or (= |ULTIMATE.start_main_~#data~1.offset| 0) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41|) 0))))) (or (not (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 0)) (= |ULTIMATE.start_main_~#data~1.base| 0)) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| Int)) (or (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41| 0) (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_41|) 0)))) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|)))] [2020-09-12 00:21:10,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-12 00:21:10,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:21:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-12 00:21:10,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-12 00:21:10,347 INFO L87 Difference]: Start difference. First operand 112 states and 178 transitions. Second operand 9 states. [2020-09-12 00:21:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:21:10,668 INFO L93 Difference]: Finished difference Result 137 states and 215 transitions. [2020-09-12 00:21:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-12 00:21:10,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-12 00:21:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:21:10,670 INFO L225 Difference]: With dead ends: 137 [2020-09-12 00:21:10,670 INFO L226 Difference]: Without dead ends: 94 [2020-09-12 00:21:10,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-09-12 00:21:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-12 00:21:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-12 00:21:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-12 00:21:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 149 transitions. [2020-09-12 00:21:10,674 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 149 transitions. Word has length 22 [2020-09-12 00:21:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:21:10,675 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 149 transitions. [2020-09-12 00:21:10,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-12 00:21:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 149 transitions. [2020-09-12 00:21:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:21:10,675 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:21:10,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:21:10,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-12 00:21:10,676 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:21:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:21:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 8 times [2020-09-12 00:21:10,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:21:10,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967261847] [2020-09-12 00:21:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:21:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:21:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:21:11,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967261847] [2020-09-12 00:21:11,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:21:11,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:21:11,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704711960] [2020-09-12 00:21:11,603 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:21:11,608 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:21:11,618 INFO L274 McrAutomatonBuilder]: Finished intersection with 40 states and 56 transitions. [2020-09-12 00:21:11,618 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:21:11,630 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,632 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,639 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,640 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,649 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,650 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,655 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,655 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,660 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,661 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,665 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,670 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:11,684 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:21:11,684 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:102, output treesize:36 [2020-09-12 00:21:11,712 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:11,712 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,716 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:11,716 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,720 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:11,720 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,724 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:11,724 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,734 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:11,734 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,739 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:11,739 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:11,761 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:21:11,761 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:132, output treesize:31 [2020-09-12 00:21:11,765 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-09-12 00:21:11,768 INFO L441 ElimStorePlain]: Different costs {0=[|#pthreadsMutex|], 2=[|v_#memory_int_159|]} [2020-09-12 00:21:11,775 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,776 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,783 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,784 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,800 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,801 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,810 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,811 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,821 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,827 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:11,828 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:11,880 INFO L625 ElimStorePlain]: treesize reduction 149, result has 19.5 percent of original size [2020-09-12 00:21:11,880 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_159| vanished before elimination [2020-09-12 00:21:11,881 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:21:11,881 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:251, output treesize:36 [2020-09-12 00:21:11,899 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-09-12 00:21:12,046 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 3 conjuncts [2020-09-12 00:21:12,060 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,061 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,069 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,070 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,079 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,080 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,089 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,090 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,098 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,099 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,107 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,107 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,235 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-09-12 00:21:12,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:12,239 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 13 xjuncts. [2020-09-12 00:21:12,240 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:248, output treesize:188 [2020-09-12 00:21:12,512 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2020-09-12 00:21:12,591 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,592 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,601 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,602 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,610 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,611 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,620 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,621 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,632 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:12,633 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,639 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:12,640 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,742 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-09-12 00:21:12,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:12,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 11 xjuncts. [2020-09-12 00:21:12,746 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:237, output treesize:167 [2020-09-12 00:21:12,863 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,865 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,868 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,872 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,874 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,875 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,877 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:12,950 INFO L625 ElimStorePlain]: treesize reduction 202, result has 11.8 percent of original size [2020-09-12 00:21:12,950 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_107| vanished before elimination [2020-09-12 00:21:12,951 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:21:12,951 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:12,951 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:21:12,951 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:369, output treesize:27 [2020-09-12 00:21:13,009 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,011 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,012 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,013 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,014 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,016 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,026 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,097 INFO L625 ElimStorePlain]: treesize reduction 202, result has 11.8 percent of original size [2020-09-12 00:21:13,098 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_108| vanished before elimination [2020-09-12 00:21:13,098 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:21:13,098 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:13,098 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:21:13,098 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:369, output treesize:27 [2020-09-12 00:21:13,115 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,117 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,118 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,119 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,121 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,124 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,125 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,127 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,225 INFO L625 ElimStorePlain]: treesize reduction 205, result has 15.6 percent of original size [2020-09-12 00:21:13,226 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_109| vanished before elimination [2020-09-12 00:21:13,226 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:21:13,226 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:13,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:21:13,227 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:403, output treesize:38 [2020-09-12 00:21:13,237 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,237 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,239 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,239 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,241 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,241 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,243 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,243 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,245 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,246 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,247 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,248 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,249 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,250 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,251 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:13,251 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:13,272 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_110| vanished before elimination [2020-09-12 00:21:13,273 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:13,273 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_110| vanished before elimination [2020-09-12 00:21:13,273 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:21:13,273 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:403, output treesize:38 [2020-09-12 00:21:13,275 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 3 conjuncts [2020-09-12 00:21:13,292 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,293 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,304 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,304 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,315 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,315 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,323 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,324 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,333 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,333 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,344 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,344 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,355 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,356 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,366 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:13,461 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,461 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,472 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,482 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,482 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,493 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,493 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,502 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,502 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,509 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,510 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,517 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,517 INFO L545 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,523 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:13,524 INFO L545 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:13,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:13,546 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_111| vanished before elimination [2020-09-12 00:21:13,546 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_111| vanished before elimination [2020-09-12 00:21:13,547 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 8 xjuncts. [2020-09-12 00:21:13,547 INFO L244 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:310, output treesize:46 [2020-09-12 00:21:26,098 WARN L193 SmtUtils]: Spent 7.96 s on a formula simplification that was a NOOP. DAG size: 33 [2020-09-12 00:21:26,104 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,104 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,106 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,106 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,108 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,108 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,110 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,110 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,112 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,112 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,114 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,114 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,116 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,116 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,118 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,118 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:26,141 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:26,141 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_112| vanished before elimination [2020-09-12 00:21:26,141 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_112| vanished before elimination [2020-09-12 00:21:26,141 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:21:26,141 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:403, output treesize:38 [2020-09-12 00:21:26,146 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,147 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,148 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,149 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,151 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,151 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,154 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,154 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,156 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,156 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,158 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,158 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,160 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,160 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,162 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,162 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:26,182 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:26,183 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_113| vanished before elimination [2020-09-12 00:21:26,183 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_113| vanished before elimination [2020-09-12 00:21:26,183 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:21:26,183 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:403, output treesize:38 [2020-09-12 00:21:26,194 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,194 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,197 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,197 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,199 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,199 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,200 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,200 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,202 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,202 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,204 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,204 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,205 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,205 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,207 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:26,207 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:26,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:26,224 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_114| vanished before elimination [2020-09-12 00:21:26,224 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:26,224 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_114| vanished before elimination [2020-09-12 00:21:26,224 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:21:26,225 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:403, output treesize:38 [2020-09-12 00:21:26,396 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [12423#(and (or (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| 0)))) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| 0))) (= my_callbackThread1of1ForFork1_~data~0.offset |ULTIMATE.start_main_~#data~1.offset|)) (or (not (= (select |#valid| my_callbackThread1of1ForFork1_~data~0.base) 0)) (= my_callbackThread1of1ForFork1_~data~0.base 0)) (or (= my_callbackThread1of1ForFork1_~data~0.offset 0) (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| 0)))) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| 0))) (<= 1 (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)))) (or (forall ((|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42|) 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_42| 0))) (<= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1))), 12424#(and (or (not (= (select |#valid| ~my_dev~0.base) 0)) (= ~my_dev~0.base 0)) (or (forall ((v_prenex_45 Int)) (or (not (= 0 (select |#valid| v_prenex_45))) (= v_prenex_45 0))) (<= (select (select |#memory_int| ~my_dev~0.base) 28) 1)) (or (forall ((v_prenex_40 Int)) (or (not (= (select |#valid| v_prenex_40) 0)) (= v_prenex_40 0))) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|)) (or (forall ((v_prenex_43 Int)) (or (= v_prenex_43 0) (not (= (select |#valid| v_prenex_43) 0)))) (<= 1 (select (select |#memory_int| ~my_dev~0.base) 28))) (or (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (forall ((v_prenex_39 Int)) (or (= v_prenex_39 0) (not (= (select |#valid| v_prenex_39) 0))))) (or (forall ((v_prenex_47 Int)) (or (= v_prenex_47 0) (not (= (select |#valid| v_prenex_47) 0)))) (= |ULTIMATE.start_main_~#data~1.offset| 0))), 12425#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (forall ((|~#t2~0.offset| Int)) (= (select (store (select (store |#memory_int| |~#t2~0.base| (store (select |#memory_int| |~#t2~0.base|) |~#t2~0.offset| 1)) my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0)) (<= 24 ~my_dev~0.offset) (<= ~my_dev~0.offset 24) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base))] [2020-09-12 00:21:26,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-12 00:21:26,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:21:26,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-12 00:21:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=174, Unknown=3, NotChecked=0, Total=210 [2020-09-12 00:21:26,397 INFO L87 Difference]: Start difference. First operand 94 states and 149 transitions. Second operand 15 states. [2020-09-12 00:21:32,140 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2020-09-12 00:21:36,472 WARN L193 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2020-09-12 00:21:36,871 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-09-12 00:21:37,069 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2020-09-12 00:21:37,405 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-09-12 00:21:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:21:37,699 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2020-09-12 00:21:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-12 00:21:37,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-09-12 00:21:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:21:37,701 INFO L225 Difference]: With dead ends: 142 [2020-09-12 00:21:37,701 INFO L226 Difference]: Without dead ends: 112 [2020-09-12 00:21:37,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=82, Invalid=376, Unknown=4, NotChecked=0, Total=462 [2020-09-12 00:21:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-12 00:21:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2020-09-12 00:21:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-12 00:21:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 171 transitions. [2020-09-12 00:21:37,705 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 171 transitions. Word has length 22 [2020-09-12 00:21:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:21:37,705 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 171 transitions. [2020-09-12 00:21:37,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-12 00:21:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 171 transitions. [2020-09-12 00:21:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:21:37,707 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:21:37,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:21:37,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-12 00:21:37,707 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:21:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:21:37,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 4 times [2020-09-12 00:21:37,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:21:37,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903987915] [2020-09-12 00:21:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:21:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:21:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:21:38,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903987915] [2020-09-12 00:21:38,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:21:38,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-12 00:21:38,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7989639] [2020-09-12 00:21:38,210 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:21:38,214 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:21:38,224 INFO L274 McrAutomatonBuilder]: Finished intersection with 40 states and 56 transitions. [2020-09-12 00:21:38,224 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:21:38,239 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:38,240 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,245 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:38,248 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,252 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:21:38,253 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:38,262 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:21:38,262 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:13 [2020-09-12 00:21:38,291 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,291 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,293 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,293 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,294 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,294 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:38,303 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:21:38,303 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:58, output treesize:13 [2020-09-12 00:21:38,311 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,315 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,317 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,343 INFO L625 ElimStorePlain]: treesize reduction 45, result has 22.4 percent of original size [2020-09-12 00:21:38,344 INFO L513 ElimStorePlain]: Eliminatee |#pthreadsMutex| vanished before elimination [2020-09-12 00:21:38,344 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:21:38,344 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:13 [2020-09-12 00:21:38,353 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,355 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,356 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,357 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,357 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,366 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:38,366 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-12 00:21:38,366 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:58, output treesize:13 [2020-09-12 00:21:38,382 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,382 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,384 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,384 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,391 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:38,391 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:38,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:38,402 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:21:38,402 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:66, output treesize:19 [2020-09-12 00:21:38,445 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12812#(and (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| ~my_dev~0.base)) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|))] [2020-09-12 00:21:38,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-12 00:21:38,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:21:38,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-12 00:21:38,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-12 00:21:38,446 INFO L87 Difference]: Start difference. First operand 111 states and 171 transitions. Second operand 9 states. [2020-09-12 00:21:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:21:38,816 INFO L93 Difference]: Finished difference Result 110 states and 169 transitions. [2020-09-12 00:21:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-12 00:21:38,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-12 00:21:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:21:38,818 INFO L225 Difference]: With dead ends: 110 [2020-09-12 00:21:38,819 INFO L226 Difference]: Without dead ends: 85 [2020-09-12 00:21:38,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-09-12 00:21:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-12 00:21:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2020-09-12 00:21:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-12 00:21:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 106 transitions. [2020-09-12 00:21:38,822 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 106 transitions. Word has length 22 [2020-09-12 00:21:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:21:38,823 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 106 transitions. [2020-09-12 00:21:38,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-12 00:21:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 106 transitions. [2020-09-12 00:21:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:21:38,823 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:21:38,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:21:38,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-12 00:21:38,824 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:21:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:21:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 9 times [2020-09-12 00:21:38,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:21:38,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477899159] [2020-09-12 00:21:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:21:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:21:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:21:39,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477899159] [2020-09-12 00:21:39,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:21:39,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:21:39,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1923910377] [2020-09-12 00:21:39,805 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:21:39,808 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:21:39,817 INFO L274 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-09-12 00:21:39,817 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:21:39,841 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,841 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,843 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,843 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,845 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,845 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,847 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,848 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,849 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,849 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,854 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,854 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:39,872 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_121| vanished before elimination [2020-09-12 00:21:39,872 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:39,873 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_121| vanished before elimination [2020-09-12 00:21:39,873 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:21:39,873 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:331, output treesize:43 [2020-09-12 00:21:39,885 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,885 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,886 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,887 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,894 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,894 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,898 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,898 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,903 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,904 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,908 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,908 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:39,929 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:21:39,929 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:138, output treesize:32 [2020-09-12 00:21:39,943 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,943 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,945 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,945 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,952 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,953 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,955 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,955 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,956 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,956 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,964 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,965 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,966 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:39,966 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:39,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:39,993 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:39,994 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_122| vanished before elimination [2020-09-12 00:21:39,994 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_122| vanished before elimination [2020-09-12 00:21:39,994 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-09-12 00:21:39,994 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:374, output treesize:32 [2020-09-12 00:21:40,010 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,010 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,012 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,012 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,014 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,014 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,015 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,016 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,017 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,017 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,020 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,020 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,022 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,022 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,023 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,024 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,025 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,025 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,050 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:40,051 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:40,051 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_123| vanished before elimination [2020-09-12 00:21:40,051 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_123| vanished before elimination [2020-09-12 00:21:40,052 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-09-12 00:21:40,052 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:454, output treesize:43 [2020-09-12 00:21:40,063 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,064 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,065 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,065 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,067 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,067 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,069 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,069 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,075 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,075 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,077 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,077 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,079 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,079 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:40,098 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:40,099 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_124| vanished before elimination [2020-09-12 00:21:40,099 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_124| vanished before elimination [2020-09-12 00:21:40,099 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-09-12 00:21:40,099 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:374, output treesize:32 [2020-09-12 00:21:40,116 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,117 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,118 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,118 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,120 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,120 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,121 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,121 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,123 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,123 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,125 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,125 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,126 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,127 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,128 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,128 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,130 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:21:40,130 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:40,158 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_125| vanished before elimination [2020-09-12 00:21:40,158 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:40,158 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_125| vanished before elimination [2020-09-12 00:21:40,158 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-09-12 00:21:40,159 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:454, output treesize:43 [2020-09-12 00:21:40,161 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 3 conjuncts [2020-09-12 00:21:40,172 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,177 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,181 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,187 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,192 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,198 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,203 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,208 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,212 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:40,312 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,312 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,320 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,320 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,329 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,330 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,345 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,345 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,355 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,356 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,365 INFO L545 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,373 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,373 INFO L545 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,379 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,380 INFO L545 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,387 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:21:40,388 INFO L545 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:40,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:21:40,411 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_126| vanished before elimination [2020-09-12 00:21:40,412 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:40,412 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2020-09-12 00:21:40,412 INFO L244 ElimStorePlain]: Needed 19 recursive calls to eliminate 5 variables, input treesize:348, output treesize:51 [2020-09-12 00:21:57,355 WARN L193 SmtUtils]: Spent 12.58 s on a formula simplification that was a NOOP. DAG size: 35 [2020-09-12 00:21:57,367 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,368 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,372 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,375 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,378 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,380 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,382 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,460 INFO L625 ElimStorePlain]: treesize reduction 202, result has 13.7 percent of original size [2020-09-12 00:21:57,460 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_127| vanished before elimination [2020-09-12 00:21:57,461 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:21:57,461 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:57,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-09-12 00:21:57,461 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:374, output treesize:32 [2020-09-12 00:21:57,466 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,467 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,469 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,472 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,473 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,475 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,478 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,557 INFO L625 ElimStorePlain]: treesize reduction 202, result has 13.7 percent of original size [2020-09-12 00:21:57,557 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_128| vanished before elimination [2020-09-12 00:21:57,557 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:21:57,557 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:57,558 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-09-12 00:21:57,558 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:374, output treesize:32 [2020-09-12 00:21:57,563 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,566 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,567 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,569 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,570 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,572 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,576 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:21:57,659 INFO L625 ElimStorePlain]: treesize reduction 202, result has 13.7 percent of original size [2020-09-12 00:21:57,659 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_129| vanished before elimination [2020-09-12 00:21:57,659 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:21:57,659 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:21:57,660 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-09-12 00:21:57,660 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:374, output treesize:32 [2020-09-12 00:21:57,706 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13081#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (forall ((|~#t2~0.offset| Int)) (= (select (store (select (store |#memory_int| |~#t2~0.base| (store (select |#memory_int| |~#t2~0.base|) |~#t2~0.offset| 1)) my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0)) (<= 24 ~my_dev~0.offset) (<= ~my_dev~0.offset 24) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1))), 13082#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.offset |ULTIMATE.start_main_~#data~1.offset|) (<= 1 (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28))) (<= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork1_~data~0.base)))] [2020-09-12 00:21:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-12 00:21:57,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:21:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-12 00:21:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=149, Unknown=3, NotChecked=0, Total=182 [2020-09-12 00:21:57,707 INFO L87 Difference]: Start difference. First operand 68 states and 106 transitions. Second operand 14 states. [2020-09-12 00:22:04,911 WARN L193 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-09-12 00:22:09,412 WARN L193 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2020-09-12 00:22:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:22:10,193 INFO L93 Difference]: Finished difference Result 94 states and 141 transitions. [2020-09-12 00:22:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-12 00:22:10,193 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-12 00:22:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:22:10,194 INFO L225 Difference]: With dead ends: 94 [2020-09-12 00:22:10,194 INFO L226 Difference]: Without dead ends: 77 [2020-09-12 00:22:10,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=74, Invalid=341, Unknown=5, NotChecked=0, Total=420 [2020-09-12 00:22:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-09-12 00:22:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2020-09-12 00:22:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-12 00:22:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2020-09-12 00:22:10,197 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 22 [2020-09-12 00:22:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:22:10,198 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2020-09-12 00:22:10,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-12 00:22:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2020-09-12 00:22:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:22:10,198 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:22:10,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:22:10,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-12 00:22:10,198 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:22:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:22:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 10 times [2020-09-12 00:22:10,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:22:10,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295415268] [2020-09-12 00:22:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:22:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:22:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:22:10,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295415268] [2020-09-12 00:22:10,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:22:10,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:22:10,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084608287] [2020-09-12 00:22:10,968 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:22:10,972 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:22:10,983 INFO L274 McrAutomatonBuilder]: Finished intersection with 43 states and 62 transitions. [2020-09-12 00:22:10,984 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:22:10,995 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-09-12 00:22:10,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,001 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:22:11,003 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:22:11,026 INFO L625 ElimStorePlain]: treesize reduction 26, result has 54.4 percent of original size [2020-09-12 00:22:11,026 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-09-12 00:22:11,027 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:96, output treesize:31 [2020-09-12 00:22:11,089 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,089 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,103 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,104 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,105 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,105 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,117 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_131| vanished before elimination [2020-09-12 00:22:11,117 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:11,117 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_131| vanished before elimination [2020-09-12 00:22:11,117 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:22:11,118 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:188, output treesize:18 [2020-09-12 00:22:11,136 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,137 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,139 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,139 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,140 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,141 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,142 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,142 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,144 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,144 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,161 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_132| vanished before elimination [2020-09-12 00:22:11,161 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:11,161 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_132| vanished before elimination [2020-09-12 00:22:11,161 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:22:11,161 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:284, output treesize:40 [2020-09-12 00:22:11,173 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,173 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,176 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,177 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,181 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,182 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,185 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,185 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,187 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,187 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,201 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:22:11,201 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:124, output treesize:32 [2020-09-12 00:22:11,208 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,208 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,215 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,216 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,218 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,218 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,219 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,220 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,226 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,226 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,244 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:11,245 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_133| vanished before elimination [2020-09-12 00:22:11,245 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_133| vanished before elimination [2020-09-12 00:22:11,245 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:11,245 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:290, output treesize:30 [2020-09-12 00:22:11,266 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,267 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,274 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,274 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,276 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,276 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,277 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,277 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,287 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,288 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,303 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:11,304 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_134| vanished before elimination [2020-09-12 00:22:11,304 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_134| vanished before elimination [2020-09-12 00:22:11,304 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:11,304 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:290, output treesize:30 [2020-09-12 00:22:11,318 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,319 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,321 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,321 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,322 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,322 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,324 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,325 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,326 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,327 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,329 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,329 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,331 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,331 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,352 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_135| vanished before elimination [2020-09-12 00:22:11,352 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:11,353 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_135| vanished before elimination [2020-09-12 00:22:11,353 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:11,353 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:368, output treesize:41 [2020-09-12 00:22:11,359 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,359 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,360 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,360 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,362 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,362 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,364 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,364 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,401 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,402 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,403 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,404 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,405 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:11,406 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,426 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_136| vanished before elimination [2020-09-12 00:22:11,426 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:11,426 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_136| vanished before elimination [2020-09-12 00:22:11,426 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:11,427 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:368, output treesize:41 [2020-09-12 00:22:11,428 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 3 conjuncts [2020-09-12 00:22:11,436 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,440 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,444 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,448 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,451 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,455 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,459 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,527 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:11,527 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,533 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:11,534 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,540 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:11,541 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,549 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:11,549 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,556 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:11,556 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,563 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:11,563 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,573 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:11,574 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:11,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:11,591 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_137| vanished before elimination [2020-09-12 00:22:11,592 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:11,592 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 7 xjuncts. [2020-09-12 00:22:11,592 INFO L244 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:280, output treesize:49 [2020-09-12 00:22:26,034 WARN L193 SmtUtils]: Spent 8.69 s on a formula simplification that was a NOOP. DAG size: 33 [2020-09-12 00:22:26,039 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,040 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,042 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,044 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,045 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,046 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,048 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,126 INFO L625 ElimStorePlain]: treesize reduction 187, result has 18.0 percent of original size [2020-09-12 00:22:26,126 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_138| vanished before elimination [2020-09-12 00:22:26,126 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:22:26,126 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:26,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:26,127 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:368, output treesize:41 [2020-09-12 00:22:26,132 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,133 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,134 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,136 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,137 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,142 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,143 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,222 INFO L625 ElimStorePlain]: treesize reduction 187, result has 18.0 percent of original size [2020-09-12 00:22:26,222 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_139| vanished before elimination [2020-09-12 00:22:26,222 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:22:26,222 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:26,223 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:26,223 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:368, output treesize:41 [2020-09-12 00:22:26,235 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,236 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,237 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,239 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,240 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,244 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,245 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,321 INFO L625 ElimStorePlain]: treesize reduction 187, result has 18.0 percent of original size [2020-09-12 00:22:26,321 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_140| vanished before elimination [2020-09-12 00:22:26,321 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:22:26,322 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:26,322 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:26,322 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:368, output treesize:41 [2020-09-12 00:22:26,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,329 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,332 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,333 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,334 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,335 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,337 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:26,414 INFO L625 ElimStorePlain]: treesize reduction 187, result has 18.0 percent of original size [2020-09-12 00:22:26,414 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:22:26,415 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_141| vanished before elimination [2020-09-12 00:22:26,415 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:26,415 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2020-09-12 00:22:26,415 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:368, output treesize:41 [2020-09-12 00:22:26,421 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13339#(and (<= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) ~my_dev~0.offset) (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (<= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (forall ((|~#t2~0.offset| Int)) (= (select (store (select (store |#memory_int| |~#t2~0.base| (store (select |#memory_int| |~#t2~0.base|) |~#t2~0.offset| 1)) my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0)) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base))] [2020-09-12 00:22:26,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-12 00:22:26,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:22:26,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-12 00:22:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=123, Unknown=4, NotChecked=0, Total=156 [2020-09-12 00:22:26,423 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand 13 states. [2020-09-12 00:22:37,089 WARN L193 SmtUtils]: Spent 9.11 s on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-09-12 00:22:41,824 WARN L193 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2020-09-12 00:22:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:22:42,397 INFO L93 Difference]: Finished difference Result 86 states and 125 transitions. [2020-09-12 00:22:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-12 00:22:42,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-09-12 00:22:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:22:42,399 INFO L225 Difference]: With dead ends: 86 [2020-09-12 00:22:42,399 INFO L226 Difference]: Without dead ends: 59 [2020-09-12 00:22:42,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=63, Invalid=274, Unknown=5, NotChecked=0, Total=342 [2020-09-12 00:22:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-12 00:22:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2020-09-12 00:22:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-12 00:22:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2020-09-12 00:22:42,402 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 22 [2020-09-12 00:22:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:22:42,402 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2020-09-12 00:22:42,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-12 00:22:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2020-09-12 00:22:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-12 00:22:42,403 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:22:42,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:22:42,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-12 00:22:42,403 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-12 00:22:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:22:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 11 times [2020-09-12 00:22:42,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:22:42,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352470307] [2020-09-12 00:22:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:22:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:22:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:22:43,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352470307] [2020-09-12 00:22:43,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:22:43,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:22:43,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451341262] [2020-09-12 00:22:43,372 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:22:43,376 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:22:43,384 INFO L274 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-09-12 00:22:43,385 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:22:43,403 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,403 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,405 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,405 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,407 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,407 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,409 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,409 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,410 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,411 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,412 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,412 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,414 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,414 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,416 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,416 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:43,438 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_142| vanished before elimination [2020-09-12 00:22:43,438 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:43,438 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_142| vanished before elimination [2020-09-12 00:22:43,438 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:22:43,439 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:405, output treesize:39 [2020-09-12 00:22:43,465 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,465 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,467 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,467 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,469 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,469 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,471 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,471 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,473 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,473 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,474 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,475 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,477 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,477 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,479 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:43,479 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:43,501 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_143| vanished before elimination [2020-09-12 00:22:43,501 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:22:43,502 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_143| vanished before elimination [2020-09-12 00:22:43,502 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-09-12 00:22:43,502 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:405, output treesize:39 [2020-09-12 00:22:43,504 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 3 conjuncts [2020-09-12 00:22:43,515 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,515 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,524 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,524 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,532 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,533 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,541 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,542 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,550 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,550 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,565 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,566 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,575 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,575 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,582 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,583 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:43,662 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,663 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,669 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,670 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,678 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,678 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,687 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,687 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,695 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,695 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,702 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,703 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,711 INFO L545 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,718 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-12 00:22:43,718 INFO L545 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:43,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:43,742 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_144| vanished before elimination [2020-09-12 00:22:43,743 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_144| vanished before elimination [2020-09-12 00:22:43,743 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 8 xjuncts. [2020-09-12 00:22:43,743 INFO L244 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:311, output treesize:47 [2020-09-12 00:22:45,189 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#data~1.offset| 0) (= 0 c_my_callbackThread1of1ForFork0_~data~0.offset) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#data~1.base|) 0)) (forall ((|~#t2~0.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_~#t2~0.base| (store (select |c_#memory_int| |c_~#t2~0.base|) |~#t2~0.offset| 1)) c_my_callbackThread1of1ForFork0_~data~0.base) (+ c_my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ c_my_callbackThread1of1ForFork0_~data~0.offset 28)) 0)) (<= 24 c_~my_dev~0.offset) (<= c_~my_dev~0.offset 24) (= c_~my_dev~0.base |c_ULTIMATE.start_main_~#data~1.base|) (= c_~my_dev~0.base c_my_callbackThread1of1ForFork0_~data~0.base)) is different from false [2020-09-12 00:22:45,216 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,217 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,222 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,227 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,228 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,233 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,234 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,239 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,240 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:45,253 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:22:45,254 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:82, output treesize:27 [2020-09-12 00:22:45,276 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:45,277 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,282 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:45,282 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,288 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:45,288 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,293 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:45,293 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,295 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:22:45,295 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:22:45,311 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:22:45,311 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:105, output treesize:24 [2020-09-12 00:22:45,315 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-09-12 00:22:45,320 INFO L441 ElimStorePlain]: Different costs {0=[|#pthreadsMutex|], 2=[|v_#memory_int_198|]} [2020-09-12 00:22:45,331 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,334 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,341 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,343 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,350 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,358 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,362 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-09-12 00:22:45,371 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:22:45,420 INFO L625 ElimStorePlain]: treesize reduction 125, result has 17.8 percent of original size [2020-09-12 00:22:45,420 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_198| vanished before elimination [2020-09-12 00:22:45,420 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:22:45,421 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:207, output treesize:27 [2020-09-12 00:22:45,482 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13550#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (not (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 0)) (forall ((|~#t2~0.offset| Int)) (= (select (store (select (store |#memory_int| |~#t2~0.base| (store (select |#memory_int| |~#t2~0.base|) |~#t2~0.offset| 1)) my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24) 1) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0)) (<= 24 ~my_dev~0.offset) (<= ~my_dev~0.offset 24) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)), 13551#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork0_~data~0.base)) (<= 24 ~my_dev~0.offset) (<= ~my_dev~0.offset 24) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base))] [2020-09-12 00:22:45,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-12 00:22:45,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:22:45,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-12 00:22:45,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2020-09-12 00:22:45,484 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 14 states. [2020-09-12 00:22:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:22:46,196 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2020-09-12 00:22:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-12 00:22:46,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-12 00:22:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:22:46,198 INFO L225 Difference]: With dead ends: 49 [2020-09-12 00:22:46,198 INFO L226 Difference]: Without dead ends: 0 [2020-09-12 00:22:46,198 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2020-09-12 00:22:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-12 00:22:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-12 00:22:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-12 00:22:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-12 00:22:46,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-09-12 00:22:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:22:46,200 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-12 00:22:46,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-12 00:22:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-12 00:22:46,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-12 00:22:46,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-12 00:22:46,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 12:22:46 BasicIcfg [2020-09-12 00:22:46,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-12 00:22:46,206 INFO L168 Benchmark]: Toolchain (without parser) took 178608.77 ms. Allocated memory was 140.5 MB in the beginning and 612.9 MB in the end (delta: 472.4 MB). Free memory was 98.4 MB in the beginning and 83.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 487.4 MB. Max. memory is 7.1 GB. [2020-09-12 00:22:46,207 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-12 00:22:46,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1831.24 ms. Allocated memory was 140.5 MB in the beginning and 235.9 MB in the end (delta: 95.4 MB). Free memory was 97.8 MB in the beginning and 167.4 MB in the end (delta: -69.6 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. [2020-09-12 00:22:46,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.72 ms. Allocated memory is still 235.9 MB. Free memory was 167.4 MB in the beginning and 163.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-09-12 00:22:46,209 INFO L168 Benchmark]: Boogie Preprocessor took 58.68 ms. Allocated memory is still 235.9 MB. Free memory was 163.1 MB in the beginning and 160.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-09-12 00:22:46,209 INFO L168 Benchmark]: RCFGBuilder took 791.40 ms. Allocated memory is still 235.9 MB. Free memory was 160.3 MB in the beginning and 112.7 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2020-09-12 00:22:46,209 INFO L168 Benchmark]: TraceAbstraction took 175833.73 ms. Allocated memory was 235.9 MB in the beginning and 612.9 MB in the end (delta: 377.0 MB). Free memory was 112.7 MB in the beginning and 83.4 MB in the end (delta: 29.3 MB). Peak memory consumption was 406.3 MB. Max. memory is 7.1 GB. [2020-09-12 00:22:46,211 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1831.24 ms. Allocated memory was 140.5 MB in the beginning and 235.9 MB in the end (delta: 95.4 MB). Free memory was 97.8 MB in the beginning and 167.4 MB in the end (delta: -69.6 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.72 ms. Allocated memory is still 235.9 MB. Free memory was 167.4 MB in the beginning and 163.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.68 ms. Allocated memory is still 235.9 MB. Free memory was 163.1 MB in the beginning and 160.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.40 ms. Allocated memory is still 235.9 MB. Free memory was 160.3 MB in the beginning and 112.7 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 175833.73 ms. Allocated memory was 235.9 MB in the beginning and 612.9 MB in the end (delta: 377.0 MB). Free memory was 112.7 MB in the beginning and 83.4 MB in the end (delta: 29.3 MB). Peak memory consumption was 406.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.2s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 1372 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5194 CheckedPairsTotal, 168 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 175.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 60.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 602 SDtfs, 794 SDslu, 2017 SDs, 0 SdLazy, 4885 SolverSat, 429 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 170 SyntacticMatches, 79 SemanticMatches, 328 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 135.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 404 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 188430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 correct! Received shutdown request...