/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:15:59,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:15:59,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:15:59,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:15:59,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:15:59,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:15:59,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:15:59,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:15:59,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:15:59,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:15:59,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:15:59,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:15:59,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:15:59,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:15:59,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:15:59,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:15:59,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:15:59,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:15:59,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:15:59,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:15:59,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:15:59,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:15:59,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:15:59,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:15:59,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:15:59,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:15:59,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:15:59,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:15:59,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:15:59,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:15:59,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:15:59,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:15:59,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:15:59,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:15:59,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:15:59,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:15:59,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:15:59,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:15:59,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:15:59,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:15:59,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:15:59,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:15:59,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:15:59,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:15:59,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:15:59,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:15:59,838 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:15:59,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:15:59,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:15:59,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:15:59,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:15:59,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:15:59,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:15:59,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:15:59,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:15:59,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:15:59,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:15:59,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:15:59,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:15:59,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:15:59,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:15:59,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:15:59,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:15:59,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:15:59,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:15:59,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:15:59,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:15:59,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:15:59,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:15:59,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:15:59,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:16:00,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:16:00,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:16:00,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:16:00,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:16:00,128 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:16:00,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2019-12-18 19:16:00,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35cbcf6f/e0eb47ee192a460698afbba183fcd633/FLAG75fc68100 [2019-12-18 19:16:00,842 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:16:00,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2019-12-18 19:16:00,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35cbcf6f/e0eb47ee192a460698afbba183fcd633/FLAG75fc68100 [2019-12-18 19:16:01,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35cbcf6f/e0eb47ee192a460698afbba183fcd633 [2019-12-18 19:16:01,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:16:01,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:16:01,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:16:01,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:16:01,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:16:01,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:16:01" (1/1) ... [2019-12-18 19:16:01,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53231c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:01, skipping insertion in model container [2019-12-18 19:16:01,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:16:01" (1/1) ... [2019-12-18 19:16:01,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:16:01,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:16:01,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:16:02,001 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:16:02,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:16:02,628 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:16:02,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02 WrapperNode [2019-12-18 19:16:02,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:16:02,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:16:02,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:16:02,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:16:02,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:16:02,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:16:02,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:16:02,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:16:02,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... [2019-12-18 19:16:02,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:16:02,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:16:02,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:16:02,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:16:02,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:16:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:16:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 19:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 19:16:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-18 19:16:02,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:16:02,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:16:02,988 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-18 19:16:02,989 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-18 19:16:02,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:16:02,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:16:02,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 19:16:02,993 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:16:03,903 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:16:03,903 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-18 19:16:03,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:16:03 BoogieIcfgContainer [2019-12-18 19:16:03,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:16:03,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:16:03,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:16:03,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:16:03,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:16:01" (1/3) ... [2019-12-18 19:16:03,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401cf486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:16:03, skipping insertion in model container [2019-12-18 19:16:03,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:02" (2/3) ... [2019-12-18 19:16:03,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401cf486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:16:03, skipping insertion in model container [2019-12-18 19:16:03,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:16:03" (3/3) ... [2019-12-18 19:16:03,913 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2019-12-18 19:16:03,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:16:03,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:16:03,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-18 19:16:03,929 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:16:03,963 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,964 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,964 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,964 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,965 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,965 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,965 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,965 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,966 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,966 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,966 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,966 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,967 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,967 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,967 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,967 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,968 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,968 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,968 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,968 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,969 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,969 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,969 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,969 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,970 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,970 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,970 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,971 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,971 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,972 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,972 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,972 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,972 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,973 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,973 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,973 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,973 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,974 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,974 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,974 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,974 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,974 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,975 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,975 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,975 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,975 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,975 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,977 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,977 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,977 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,977 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,978 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,978 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,978 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,979 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,979 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,979 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,979 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,979 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,980 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,980 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,980 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,981 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,981 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,985 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,985 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,985 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,986 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,986 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,986 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,986 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,987 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,987 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,987 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,987 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,987 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,996 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,996 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,996 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,997 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,997 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,998 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:03,999 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:04,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 19:16:04,058 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:16:04,059 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:16:04,059 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:16:04,059 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:16:04,059 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:16:04,059 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:16:04,060 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:16:04,060 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:16:04,086 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 157 transitions [2019-12-18 19:16:04,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions [2019-12-18 19:16:04,174 INFO L126 PetriNetUnfolder]: 13/215 cut-off events. [2019-12-18 19:16:04,175 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:16:04,209 INFO L76 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 215 events. 13/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 443 event pairs. 21/212 useless extension candidates. Maximal degree in co-relation 97. Up to 4 conditions per place. [2019-12-18 19:16:04,222 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions [2019-12-18 19:16:04,290 INFO L126 PetriNetUnfolder]: 13/215 cut-off events. [2019-12-18 19:16:04,290 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:16:04,293 INFO L76 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 215 events. 13/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 443 event pairs. 21/212 useless extension candidates. Maximal degree in co-relation 97. Up to 4 conditions per place. [2019-12-18 19:16:04,299 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4004 [2019-12-18 19:16:04,300 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:16:04,626 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:04,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:04,660 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:04,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:04,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:04,690 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-18 19:16:04,948 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:04,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:04,989 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:05,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:05,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:05,020 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:05,036 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:05,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:05,082 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:05,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:05,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:05,116 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:08,235 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:08,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:08,285 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:08,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:08,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:08,316 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:08,341 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:08,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:08,383 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:08,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:08,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:08,416 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:10,463 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:10,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:10,505 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:10,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:10,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:10,536 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:10,558 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:10,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:10,596 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:10,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:10,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:10,626 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:12,657 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:12,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:12,690 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:12,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:12,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:12,718 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:12,739 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:12,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:12,775 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:12,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:12,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:12,805 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:17,421 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-18 19:16:17,855 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:17,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:17,907 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:17,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:17,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:17,938 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:17,950 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:17,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:17,995 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:18,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:18,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:18,023 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:20,039 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:20,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:20,085 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:20,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:20,118 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:20,119 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:20,140 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:20,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:20,183 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:20,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:20,213 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:20,214 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:22,280 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:22,315 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:22,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,339 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-18 19:16:22,523 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:22,565 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:22,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,600 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:22,613 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:22,663 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:22,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:22,707 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:25,220 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-18 19:16:25,475 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-18 19:16:25,488 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:25,615 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 19:16:25,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:25,622 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:16:25,733 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-18 19:16:25,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:25,734 INFO L534 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. [2019-12-18 19:16:25,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2019-12-18 19:16:25,851 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-18 19:16:26,542 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-18 19:16:26,920 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-18 19:16:27,153 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-18 19:16:27,550 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-12-18 19:16:27,828 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-12-18 19:16:27,946 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-18 19:16:28,666 WARN L192 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2019-12-18 19:16:28,927 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-12-18 19:16:29,898 WARN L192 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2019-12-18 19:16:30,340 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-18 19:16:30,353 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8278 [2019-12-18 19:16:30,354 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-18 19:16:30,357 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 45 transitions [2019-12-18 19:16:30,388 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 532 states. [2019-12-18 19:16:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states. [2019-12-18 19:16:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-18 19:16:30,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:16:30,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-18 19:16:30,397 INFO L410 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]=== [2019-12-18 19:16:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:16:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 17185309, now seen corresponding path program 1 times [2019-12-18 19:16:30,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:16:30,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670447389] [2019-12-18 19:16:30,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:16:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:16:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:16:30,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670447389] [2019-12-18 19:16:30,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:16:30,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:16:30,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103786933] [2019-12-18 19:16:30,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:16:30,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:16:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:16:30,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:16:30,835 INFO L87 Difference]: Start difference. First operand 532 states. Second operand 3 states. [2019-12-18 19:16:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:16:31,020 INFO L93 Difference]: Finished difference Result 687 states and 1665 transitions. [2019-12-18 19:16:31,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:16:31,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-18 19:16:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:16:31,042 INFO L225 Difference]: With dead ends: 687 [2019-12-18 19:16:31,042 INFO L226 Difference]: Without dead ends: 612 [2019-12-18 19:16:31,043 INFO L631 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 [2019-12-18 19:16:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-18 19:16:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 516. [2019-12-18 19:16:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-18 19:16:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1218 transitions. [2019-12-18 19:16:31,148 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1218 transitions. Word has length 4 [2019-12-18 19:16:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:16:31,148 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 1218 transitions. [2019-12-18 19:16:31,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:16:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1218 transitions. [2019-12-18 19:16:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-18 19:16:31,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:16:31,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-18 19:16:31,150 INFO L410 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]=== [2019-12-18 19:16:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:16:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash -664803785, now seen corresponding path program 1 times [2019-12-18 19:16:31,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:16:31,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973226460] [2019-12-18 19:16:31,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:16:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:16:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:16:31,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973226460] [2019-12-18 19:16:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:16:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:16:31,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899818973] [2019-12-18 19:16:31,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:16:31,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:16:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:16:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:16:31,296 INFO L87 Difference]: Start difference. First operand 516 states and 1218 transitions. Second operand 4 states. [2019-12-18 19:16:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:16:31,532 INFO L93 Difference]: Finished difference Result 671 states and 1561 transitions. [2019-12-18 19:16:31,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:16:31,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-18 19:16:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:16:31,538 INFO L225 Difference]: With dead ends: 671 [2019-12-18 19:16:31,538 INFO L226 Difference]: Without dead ends: 586 [2019-12-18 19:16:31,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:16:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-18 19:16:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 554. [2019-12-18 19:16:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-18 19:16:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1327 transitions. [2019-12-18 19:16:31,565 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1327 transitions. Word has length 6 [2019-12-18 19:16:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:16:31,566 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1327 transitions. [2019-12-18 19:16:31,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:16:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1327 transitions. [2019-12-18 19:16:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 19:16:31,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:16:31,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:16:31,568 INFO L410 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]=== [2019-12-18 19:16:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:16:31,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1722397114, now seen corresponding path program 1 times [2019-12-18 19:16:31,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:16:31,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191603325] [2019-12-18 19:16:31,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:16:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:16:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:16:31,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191603325] [2019-12-18 19:16:31,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:16:31,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:16:31,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807474958] [2019-12-18 19:16:31,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:16:31,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:16:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:16:31,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:16:31,644 INFO L87 Difference]: Start difference. First operand 554 states and 1327 transitions. Second operand 3 states. [2019-12-18 19:16:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:16:31,662 INFO L93 Difference]: Finished difference Result 234 states and 479 transitions. [2019-12-18 19:16:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:16:31,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-18 19:16:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:16:31,664 INFO L225 Difference]: With dead ends: 234 [2019-12-18 19:16:31,664 INFO L226 Difference]: Without dead ends: 234 [2019-12-18 19:16:31,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:16:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-18 19:16:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-12-18 19:16:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-18 19:16:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 479 transitions. [2019-12-18 19:16:31,672 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 479 transitions. Word has length 10 [2019-12-18 19:16:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:16:31,672 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 479 transitions. [2019-12-18 19:16:31,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:16:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 479 transitions. [2019-12-18 19:16:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:16:31,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:16:31,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:16:31,675 INFO L410 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]=== [2019-12-18 19:16:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:16:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash -844855109, now seen corresponding path program 1 times [2019-12-18 19:16:31,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:16:31,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942510634] [2019-12-18 19:16:31,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:16:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:16:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:16:31,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942510634] [2019-12-18 19:16:31,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:16:31,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:16:31,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358913806] [2019-12-18 19:16:31,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:16:31,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:16:31,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:16:31,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:16:31,764 INFO L87 Difference]: Start difference. First operand 234 states and 479 transitions. Second operand 3 states. [2019-12-18 19:16:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:16:31,901 INFO L93 Difference]: Finished difference Result 279 states and 550 transitions. [2019-12-18 19:16:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:16:31,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 19:16:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:16:31,903 INFO L225 Difference]: With dead ends: 279 [2019-12-18 19:16:31,904 INFO L226 Difference]: Without dead ends: 279 [2019-12-18 19:16:31,904 INFO L631 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 [2019-12-18 19:16:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-18 19:16:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 246. [2019-12-18 19:16:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-18 19:16:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 499 transitions. [2019-12-18 19:16:31,913 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 499 transitions. Word has length 16 [2019-12-18 19:16:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:16:31,914 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 499 transitions. [2019-12-18 19:16:31,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:16:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 499 transitions. [2019-12-18 19:16:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:16:31,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:16:31,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:16:31,916 INFO L410 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]=== [2019-12-18 19:16:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:16:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash -420706071, now seen corresponding path program 1 times [2019-12-18 19:16:31,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:16:31,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115631500] [2019-12-18 19:16:31,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:16:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:16:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:16:32,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115631500] [2019-12-18 19:16:32,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:16:32,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:16:32,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093107161] [2019-12-18 19:16:32,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:16:32,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:16:32,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:16:32,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:16:32,002 INFO L87 Difference]: Start difference. First operand 246 states and 499 transitions. Second operand 3 states. [2019-12-18 19:16:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:16:32,123 INFO L93 Difference]: Finished difference Result 283 states and 556 transitions. [2019-12-18 19:16:32,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:16:32,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 19:16:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:16:32,126 INFO L225 Difference]: With dead ends: 283 [2019-12-18 19:16:32,126 INFO L226 Difference]: Without dead ends: 283 [2019-12-18 19:16:32,126 INFO L631 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 [2019-12-18 19:16:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-18 19:16:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 258. [2019-12-18 19:16:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-12-18 19:16:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 527 transitions. [2019-12-18 19:16:32,134 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 527 transitions. Word has length 17 [2019-12-18 19:16:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:16:32,134 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 527 transitions. [2019-12-18 19:16:32,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:16:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 527 transitions. [2019-12-18 19:16:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:16:32,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:16:32,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:16:32,136 INFO L410 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]=== [2019-12-18 19:16:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:16:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1300998096, now seen corresponding path program 1 times [2019-12-18 19:16:32,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:16:32,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699642482] [2019-12-18 19:16:32,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:16:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:16:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:16:32,301 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:16:32,302 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:16:32,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [532] [532] ULTIMATE.startENTRY-->L1713-1: Formula: (let ((.cse5 (store |v_#valid_86| 0 0))) (let ((.cse6 (store .cse5 |v_~#t1~0.base_21| 1))) (let ((.cse1 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_18 24)) (.cse2 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_18 28)) (.cse3 (store .cse6 |v_~#t2~0.base_22| 1))) (and (= (let ((.cse0 (store |v_#memory_$Pointer$.base_258| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_$Pointer$.base_258| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse1 v_DerPreprocessor_59) .cse2 v_DerPreprocessor_57)))) (store .cse0 |v_~#t1~0.base_21| (store (select .cse0 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| (select (select |v_#memory_$Pointer$.base_257| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|)))) |v_#memory_$Pointer$.base_257|) (= (store .cse3 |v_ULTIMATE.start_main_~#data~1.base_111| 1) |v_#valid_84|) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#data~1.base_111|) (= |v_#memory_int_302| (let ((.cse4 (store |v_#memory_int_303| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_int_303| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse1 0) .cse2 0)))) (store .cse4 |v_~#t1~0.base_21| (store (select .cse4 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| 0)))) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_15| v_ULTIMATE.start_my_drv_probe_~data.offset_18) (= v_ULTIMATE.start_my_drv_probe_~d~0.base_17 v_ULTIMATE.start_my_drv_probe_~data.base_18) (= |v_~#t1~0.offset_21| 0) (= (select .cse5 |v_~#t1~0.base_21|) 0) (= (store (store (store |v_#length_48| |v_~#t1~0.base_21| 4) |v_~#t2~0.base_22| 4) |v_ULTIMATE.start_main_~#data~1.base_111| 32) |v_#length_46|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| |v_ULTIMATE.start_main_~#data~1.base_111|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| v_ULTIMATE.start_my_drv_probe_~data.base_18) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_15| |v_ULTIMATE.start_main_~#data~1.offset_105|) (= |v_~#t2~0.offset_22| 0) (< |v_#StackHeapBarrier_24| |v_~#t1~0.base_21|) (= (select .cse6 |v_~#t2~0.base_22|) 0) (= 0 |v_ULTIMATE.start_main_~#data~1.offset_105|) (< |v_#StackHeapBarrier_24| |v_~#t2~0.base_22|) (= |v_#NULL.offset_5| 0) (= 0 |v_ULTIMATE.start_my_drv_init_#res_16|) (= v_ULTIMATE.start_my_drv_probe_~res~0_22 0) (= 0 v_ULTIMATE.start_main_~ret~0_22) (= v_ULTIMATE.start_my_drv_probe_~d~0.offset_17 .cse1) (= |v_#memory_$Pointer$.offset_257| (let ((.cse7 (store |v_#memory_$Pointer$.offset_258| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_$Pointer$.offset_258| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse1 v_DerPreprocessor_58) .cse2 v_DerPreprocessor_60)))) (store .cse7 |v_~#t1~0.base_21| (store (select .cse7 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| (select (select |v_#memory_$Pointer$.offset_257| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|))))) (= 0 (select .cse3 |v_ULTIMATE.start_main_~#data~1.base_111|)) (= (select (select |v_#memory_int_303| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|) 0) (= 0 |v_#NULL.base_5|) (= (select (select |v_#memory_int_303| |v_~#t2~0.base_22|) |v_~#t2~0.offset_22|) 0) (= |v_#pthreadsMutex_157| (store |v_#pthreadsMutex_158| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (select |v_#pthreadsMutex_158| v_ULTIMATE.start_my_drv_probe_~data.base_18) v_ULTIMATE.start_my_drv_probe_~data.offset_18 0))) (< 0 |v_#StackHeapBarrier_24|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_158|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_258|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_303|, #length=|v_#length_48|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_258|} OutVars{ULTIMATE.start_main_#t~mem45=|v_ULTIMATE.start_main_#t~mem45_34|, ULTIMATE.start_main_#t~mem46=|v_ULTIMATE.start_main_#t~mem46_52|, ULTIMATE.start_main_#t~mem43=|v_ULTIMATE.start_main_#t~mem43_33|, ULTIMATE.start_main_#t~mem44=|v_ULTIMATE.start_main_#t~mem44_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_257|, ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_20|, #NULL.offset=|v_#NULL.offset_5|, ~#t1~0.offset=|v_~#t1~0.offset_21|, ~#t1~0.base=|v_~#t1~0.base_21|, ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_18, ULTIMATE.start_my_drv_init_#res=|v_ULTIMATE.start_my_drv_init_#res_16|, ~#t2~0.offset=|v_~#t2~0.offset_22|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_105|, #length=|v_#length_46|, ~#t2~0.base=|v_~#t2~0.base_22|, #pthreadsMutex=|v_#pthreadsMutex_157|, ULTIMATE.start_my_drv_probe_#in~data.base=|v_ULTIMATE.start_my_drv_probe_#in~data.base_15|, ULTIMATE.start_my_drv_probe_~d~0.offset=v_ULTIMATE.start_my_drv_probe_~d~0.offset_17, ULTIMATE.start_main_~ret~0=v_ULTIMATE.start_main_~ret~0_22, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_18, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_29|, ULTIMATE.start_my_drv_probe_#in~data.offset=|v_ULTIMATE.start_my_drv_probe_#in~data.offset_15|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_31|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_12|, ULTIMATE.start_my_drv_probe_#t~nondet32=|v_ULTIMATE.start_my_drv_probe_#t~nondet32_25|, ULTIMATE.start_my_drv_probe_~res~0=v_ULTIMATE.start_my_drv_probe_~res~0_22, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_my_drv_probe_~d~0.base=v_ULTIMATE.start_my_drv_probe_~d~0.base_17, #StackHeapBarrier=|v_#StackHeapBarrier_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_302|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_33, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_111|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_257|} AuxVars[v_DerPreprocessor_57, v_DerPreprocessor_58, v_DerPreprocessor_59, v_DerPreprocessor_60] AssignedVars[ULTIMATE.start_main_#t~mem45, ULTIMATE.start_main_#t~mem46, ULTIMATE.start_main_#t~mem43, ULTIMATE.start_main_#t~mem44, #memory_$Pointer$.base, ULTIMATE.start_my_drv_probe_#res, #NULL.offset, ~#t1~0.offset, ~#t1~0.base, ULTIMATE.start_my_drv_probe_~data.base, ULTIMATE.start_my_drv_init_#res, ~#t2~0.offset, ULTIMATE.start_main_~#data~1.offset, #length, ~#t2~0.base, #pthreadsMutex, ULTIMATE.start_my_drv_probe_#in~data.base, ULTIMATE.start_my_drv_probe_~d~0.offset, ULTIMATE.start_main_~ret~0, ULTIMATE.start_my_drv_probe_~data.offset, ULTIMATE.start_main_#t~ret41, ULTIMATE.start_my_drv_probe_#in~data.offset, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_my_drv_probe_#t~nondet33, ULTIMATE.start_my_drv_probe_#t~nondet32, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_my_drv_probe_#t~nondet34, #NULL.base, ULTIMATE.start_my_drv_probe_~d~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_main_~#data~1.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-18 19:16:32,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [512] [512] my_callbackENTRY-->L1700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_138| v_my_callbackThread1of1ForFork0_~data~0.base_95))) (and (= (+ v_my_callbackThread1of1ForFork0_~__mptr~0.offset_10 (- 24)) v_my_callbackThread1of1ForFork0_~data~0.offset_95) (= v_my_callbackThread1of1ForFork0_~dev~0.base_11 v_my_callbackThread1of1ForFork0_~arg.base_10) (= v_my_callbackThread1of1ForFork0_~arg.offset_10 |v_my_callbackThread1of1ForFork0_#in~arg.offset_4|) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_95) 0) (= v_my_callbackThread1of1ForFork0_~dev~0.base_11 v_my_callbackThread1of1ForFork0_~__mptr~0.base_10) (= v_my_callbackThread1of1ForFork0_~arg.base_10 |v_my_callbackThread1of1ForFork0_#in~arg.base_4|) (= |v_#pthreadsMutex_137| (store |v_#pthreadsMutex_138| v_my_callbackThread1of1ForFork0_~data~0.base_95 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_95 1))) (= v_my_callbackThread1of1ForFork0_~data~0.base_95 v_my_callbackThread1of1ForFork0_~__mptr~0.base_10) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_11 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_10) (= v_my_callbackThread1of1ForFork0_~arg.offset_10 v_my_callbackThread1of1ForFork0_~dev~0.offset_11))) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_4|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_95, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_4|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_10, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_10, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_4|, my_callbackThread1of1ForFork0_#t~nondet30=|v_my_callbackThread1of1ForFork0_#t~nondet30_22|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_10, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_10, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_11, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_95, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_11} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, my_callbackThread1of1ForFork0_#t~nondet30, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~dev~0.offset] because there is no mapped edge [2019-12-18 19:16:32,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [421] [421] L1713-2-->L1714-1: Formula: (and (= (store |v_#memory_$Pointer$.offset_73| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.offset_73| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.offset_72| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|))) |v_#memory_$Pointer$.offset_72|) (= (store |v_#memory_int_88| |v_~#t2~0.base_6| (store (select |v_#memory_int_88| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| 1)) |v_#memory_int_87|) (= (store |v_#memory_$Pointer$.base_73| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.base_73| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.base_72| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|))) |v_#memory_$Pointer$.base_72|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_73|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_88|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_73|, ~#t2~0.base=|v_~#t2~0.base_6|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_72|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_72|, ~#t2~0.base=|v_~#t2~0.base_6|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet33, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-18 19:16:32,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [422] [422] L1701-->L1702: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_38 28))) (and (= |v_#memory_$Pointer$.offset_78| (store |v_#memory_$Pointer$.offset_79| v_my_callbackThread1of1ForFork0_~data~0.base_38 (store (select |v_#memory_$Pointer$.offset_79| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0 (select (select |v_#memory_$Pointer$.offset_78| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0)))) (= |v_#memory_$Pointer$.base_78| (store |v_#memory_$Pointer$.base_79| v_my_callbackThread1of1ForFork0_~data~0.base_38 (store (select |v_#memory_$Pointer$.base_79| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0 (select (select |v_#memory_$Pointer$.base_78| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0)))) (= (store |v_#memory_int_94| v_my_callbackThread1of1ForFork0_~data~0.base_38 (store (select |v_#memory_int_94| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem31_13| 1))) |v_#memory_int_93|))) InVars {my_callbackThread1of1ForFork0_#t~mem31=|v_my_callbackThread1of1ForFork0_#t~mem31_13|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_38, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_79|, #memory_int=|v_#memory_int_94|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_38, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_79|} OutVars{my_callbackThread1of1ForFork0_#t~mem31=|v_my_callbackThread1of1ForFork0_#t~mem31_12|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_38, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_78|, #memory_int=|v_#memory_int_93|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_38, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_78|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem31, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-18 19:16:32,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1702-->my_callbackEXIT: Formula: (and (= (store |v_#pthreadsMutex_66| v_my_callbackThread1of1ForFork0_~data~0.base_59 (store (select |v_#pthreadsMutex_66| v_my_callbackThread1of1ForFork0_~data~0.base_59) v_my_callbackThread1of1ForFork0_~data~0.offset_59 0)) |v_#pthreadsMutex_65|) (= |v_my_callbackThread1of1ForFork0_#res.base_15| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_15| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_66|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_59, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_59} OutVars{#pthreadsMutex=|v_#pthreadsMutex_65|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_59, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_15|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_15|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_59} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 19:16:32,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] my_callbackENTRY-->L1700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_114| v_my_callbackThread1of1ForFork1_~data~0.base_63))) (and (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_9 v_my_callbackThread1of1ForFork1_~data~0.base_63) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_9 v_my_callbackThread1of1ForFork1_~dev~0.base_11) (= (+ v_my_callbackThread1of1ForFork1_~__mptr~0.offset_9 (- 24)) v_my_callbackThread1of1ForFork1_~data~0.offset_63) (= |v_my_callbackThread1of1ForFork1_#in~arg.base_5| v_my_callbackThread1of1ForFork1_~arg.base_7) (= (store |v_#pthreadsMutex_114| v_my_callbackThread1of1ForFork1_~data~0.base_63 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_63 1)) |v_#pthreadsMutex_113|) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_11 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_9) (= |v_my_callbackThread1of1ForFork1_#in~arg.offset_5| v_my_callbackThread1of1ForFork1_~arg.offset_7) (= v_my_callbackThread1of1ForFork1_~dev~0.base_11 v_my_callbackThread1of1ForFork1_~arg.base_7) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_11 v_my_callbackThread1of1ForFork1_~arg.offset_7) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_63) 0))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_5|, #pthreadsMutex=|v_#pthreadsMutex_114|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_5|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_5|, #pthreadsMutex=|v_#pthreadsMutex_113|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_63, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_63, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_7, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_7, my_callbackThread1of1ForFork1_#t~nondet30=|v_my_callbackThread1of1ForFork1_#t~nondet30_22|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_9, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_9, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_11, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_11, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_5|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_#t~nondet30, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base] because there is no mapped edge [2019-12-18 19:16:32,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [474] [474] L1714-2-->L1741-4: Formula: (and (= |v_ULTIMATE.start_my_drv_probe_#res_11| |v_ULTIMATE.start_main_#t~ret42_15|) (= |v_ULTIMATE.start_main_#t~ret42_15| v_ULTIMATE.start_main_~probe_ret~0_15) (= |v_ULTIMATE.start_my_drv_probe_#res_11| 0)) InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_11|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_15|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_15, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_6|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_my_drv_probe_#t~nondet34] because there is no mapped edge [2019-12-18 19:16:32,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [511] [511] L1741-4-->L1722: Formula: (and (= |v_#valid_58| (store |v_#valid_59| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8| v_ULTIMATE.start_my_drv_disconnect_~data.base_39) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8| |v_ULTIMATE.start_main_~#data~1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem35_14| (select (select |v_#memory_int_241| |v_~#t1~0.base_14|) |v_~#t1~0.offset_14|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8| v_ULTIMATE.start_my_drv_disconnect_~data.offset_39) (= 0 (select |v_#valid_59| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8| |v_ULTIMATE.start_main_~#data~1.offset_91|) (= 0 v_ULTIMATE.start_main_~probe_ret~0_24) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_16| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, ~#t1~0.base=|v_~#t1~0.base_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_241|, ~#t1~0.offset=|v_~#t1~0.offset_14|, #length=|v_#length_30|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_91|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_24, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_95|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_39, ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_20|, ULTIMATE.start_my_drv_disconnect_#t~mem37=|v_ULTIMATE.start_my_drv_disconnect_#t~mem37_25|, ULTIMATE.start_my_drv_disconnect_#in~data.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8|, ULTIMATE.start_my_drv_disconnect_#t~mem39=|v_ULTIMATE.start_my_drv_disconnect_#t~mem39_17|, ULTIMATE.start_my_drv_disconnect_#t~mem35=|v_ULTIMATE.start_my_drv_disconnect_#t~mem35_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.base_13|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_23|, ~#t1~0.offset=|v_~#t1~0.offset_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet40.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet40.base_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset_14|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_16|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~#t1~0.base=|v_~#t1~0.base_14|, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_39, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_241|, #length=|v_#length_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset_13|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_91|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_24, ULTIMATE.start_my_drv_disconnect_#in~data.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_95|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem38, ULTIMATE.start_my_drv_disconnect_#t~mem37, ULTIMATE.start_my_drv_disconnect_#in~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem39, ULTIMATE.start_my_drv_disconnect_#t~mem35, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_my_drv_disconnect_#t~nondet40.base, ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~data.base, ULTIMATE.start_my_drv_disconnect_~#status~0.base, #valid, #length, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset, ULTIMATE.start_my_drv_disconnect_#in~data.base] because there is no mapped edge [2019-12-18 19:16:32,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [458] [458] L1722-2-->L1723-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_my_drv_disconnect_~data.offset_25 24))) (and (= |v_#memory_$Pointer$.base_134| (store |v_#memory_$Pointer$.base_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25 (store (select |v_#memory_$Pointer$.base_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0 (select (select |v_#memory_$Pointer$.base_134| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0)))) (= (store |v_#memory_$Pointer$.offset_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25 (store (select |v_#memory_$Pointer$.offset_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0 (select (select |v_#memory_$Pointer$.offset_134| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0))) |v_#memory_$Pointer$.offset_134|) (= (store |v_#memory_int_155| v_ULTIMATE.start_my_drv_disconnect_~data.base_25 (store (select |v_#memory_int_155| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0 3)) |v_#memory_int_154|))) InVars {ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_25, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_25, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_135|, #memory_int=|v_#memory_int_155|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_135|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_25, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_25, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_134|, ULTIMATE.start_my_drv_disconnect_#t~mem35=|v_ULTIMATE.start_my_drv_disconnect_#t~mem35_10|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.base_9|, #memory_int=|v_#memory_int_154|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_134|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~mem35, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-18 19:16:32,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [481] [481] L1724-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start_ldv_assert_~expression_72 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem37_19| (select (select |v_#memory_int_171| v_ULTIMATE.start_my_drv_disconnect_~data.base_31) (+ v_ULTIMATE.start_my_drv_disconnect_~data.offset_31 24))) (= v_ULTIMATE.start_ldv_assert_~expression_72 |v_ULTIMATE.start_ldv_assert_#in~expression_47|) (not (= 3 |v_ULTIMATE.start_my_drv_disconnect_#t~mem37_19|))) InVars {ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_31, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_31, #memory_int=|v_#memory_int_171|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_31, ULTIMATE.start_my_drv_disconnect_#t~mem37=|v_ULTIMATE.start_my_drv_disconnect_#t~mem37_19|, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_31, #memory_int=|v_#memory_int_171|, ULTIMATE.start_ldv_assert_#in~expression=|v_ULTIMATE.start_ldv_assert_#in~expression_47|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_72} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem37, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2019-12-18 19:16:32,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:16:32 BasicIcfg [2019-12-18 19:16:32,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:16:32,348 INFO L168 Benchmark]: Toolchain (without parser) took 31271.27 ms. Allocated memory was 138.4 MB in the beginning and 313.5 MB in the end (delta: 175.1 MB). Free memory was 98.6 MB in the beginning and 92.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 181.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:32,349 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 19:16:32,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1553.63 ms. Allocated memory was 138.4 MB in the beginning and 237.0 MB in the end (delta: 98.6 MB). Free memory was 98.4 MB in the beginning and 169.8 MB in the end (delta: -71.5 MB). Peak memory consumption was 78.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:32,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 163.29 ms. Allocated memory is still 237.0 MB. Free memory was 168.4 MB in the beginning and 165.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:32,353 INFO L168 Benchmark]: Boogie Preprocessor took 95.71 ms. Allocated memory is still 237.0 MB. Free memory was 165.4 MB in the beginning and 162.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:32,354 INFO L168 Benchmark]: RCFGBuilder took 1014.88 ms. Allocated memory is still 237.0 MB. Free memory was 162.5 MB in the beginning and 114.4 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:32,358 INFO L168 Benchmark]: TraceAbstraction took 28438.18 ms. Allocated memory was 237.0 MB in the beginning and 313.5 MB in the end (delta: 76.5 MB). Free memory was 114.4 MB in the beginning and 92.7 MB in the end (delta: 21.6 MB). Peak memory consumption was 98.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:32,364 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1553.63 ms. Allocated memory was 138.4 MB in the beginning and 237.0 MB in the end (delta: 98.6 MB). Free memory was 98.4 MB in the beginning and 169.8 MB in the end (delta: -71.5 MB). Peak memory consumption was 78.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 163.29 ms. Allocated memory is still 237.0 MB. Free memory was 168.4 MB in the beginning and 165.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.71 ms. Allocated memory is still 237.0 MB. Free memory was 165.4 MB in the beginning and 162.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1014.88 ms. Allocated memory is still 237.0 MB. Free memory was 162.5 MB in the beginning and 114.4 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28438.18 ms. Allocated memory was 237.0 MB in the beginning and 313.5 MB in the end (delta: 76.5 MB). Free memory was 114.4 MB in the beginning and 92.7 MB in the end (delta: 21.6 MB). Peak memory consumption was 98.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 26.2s, 153 ProgramPointsBefore, 45 ProgramPointsAfterwards, 157 TransitionsBefore, 45 TransitionsAfterwards, 4004 CoEnabledTransitionPairs, 8 FixpointIterations, 66 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 20 ConcurrentYvCompositions, 5 ChoiceCompositions, 2208 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 7 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 16.1s, 0 MoverChecksTotal, 8278 CheckedPairsTotal, 160 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={7:24}, t1={6:0}, t2={5:0}] [L1700] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1701] 1 data->shared.b VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, data->shared.b=0, dev={7:24}, t1={6:0}, t2={5:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1724] 0 data->shared.b = 3 VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 132 locations, 6 error locations. Result: UNSAFE, OverallTime: 28.2s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 184 SDtfs, 82 SDslu, 101 SDs, 0 SdLazy, 173 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 186 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 1470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...