./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca0a1e4d7e3711007343b5979fe7978b3c373b5f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:47:37,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:37,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:37,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:37,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:37,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:37,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:37,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:37,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:37,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:37,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:37,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:37,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:37,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:38,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:38,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:38,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:38,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:38,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:38,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:38,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:38,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:38,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:38,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:38,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:38,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:38,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:38,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:38,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:38,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:38,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:38,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:38,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:38,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:38,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:38,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:38,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:38,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:38,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:38,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:38,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:38,022 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:47:38,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:38,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:38,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:38,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:38,036 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:38,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:38,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:38,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:38,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:38,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:38,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:38,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:38,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:38,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:38,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:38,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:38,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:38,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:38,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:38,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:38,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:38,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:38,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:38,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:38,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:38,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:38,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:38,041 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:38,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca0a1e4d7e3711007343b5979fe7978b3c373b5f [2019-11-25 08:47:38,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:38,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:38,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:38,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:38,189 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:38,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2019-11-25 08:47:38,238 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/data/250190966/893a1205e282460c9d3ab7dc8d78a776/FLAGb07fcc40f [2019-11-25 08:47:38,676 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:38,677 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2019-11-25 08:47:38,696 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/data/250190966/893a1205e282460c9d3ab7dc8d78a776/FLAGb07fcc40f [2019-11-25 08:47:38,975 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/data/250190966/893a1205e282460c9d3ab7dc8d78a776 [2019-11-25 08:47:38,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:38,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:38,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:38,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:38,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:38,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:38" (1/1) ... [2019-11-25 08:47:38,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2c4c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:38, skipping insertion in model container [2019-11-25 08:47:38,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:38" (1/1) ... [2019-11-25 08:47:38,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:39,027 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:39,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:39,402 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:39,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:39,510 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:39,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39 WrapperNode [2019-11-25 08:47:39,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:39,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:39,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:39,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:39,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:39,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:39,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:39,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:39,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:39,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:39,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:39,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:39,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/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-11-25 08:47:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-25 08:47:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-25 08:47:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:47:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:47:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:47:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:39,642 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:47:39,747 INFO L1493 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_acquire_returnLabel [2019-11-25 08:47:39,748 INFO L1493 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel [2019-11-25 08:47:39,749 INFO L1493 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_acquire_returnLabel#2 [2019-11-25 08:47:39,749 INFO L1493 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel#2 [2019-11-25 08:47:39,864 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:39,864 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:47:39,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:39 BoogieIcfgContainer [2019-11-25 08:47:39,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:39,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:39,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:39,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:39,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:38" (1/3) ... [2019-11-25 08:47:39,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c07e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:39, skipping insertion in model container [2019-11-25 08:47:39,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (2/3) ... [2019-11-25 08:47:39,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c07e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:39, skipping insertion in model container [2019-11-25 08:47:39,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:39" (3/3) ... [2019-11-25 08:47:39,886 INFO L109 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2019-11-25 08:47:39,930 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,934 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,934 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,934 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,934 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,937 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:47:39,956 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:47:39,957 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:39,962 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-25 08:47:39,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-25 08:47:39,986 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:39,987 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:39,987 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:39,987 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:39,987 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:39,987 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:39,987 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:39,987 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:39,997 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 72 transitions [2019-11-25 08:47:45,430 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39329 states. [2019-11-25 08:47:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 39329 states. [2019-11-25 08:47:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:47:45,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:45,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:45,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1620890226, now seen corresponding path program 1 times [2019-11-25 08:47:45,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:45,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437098897] [2019-11-25 08:47:45,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:45,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437098897] [2019-11-25 08:47:45,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:45,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:45,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684854774] [2019-11-25 08:47:45,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:45,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:45,764 INFO L87 Difference]: Start difference. First operand 39329 states. Second operand 5 states. [2019-11-25 08:47:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:46,252 INFO L93 Difference]: Finished difference Result 20592 states and 72439 transitions. [2019-11-25 08:47:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:47:46,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 08:47:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:46,453 INFO L225 Difference]: With dead ends: 20592 [2019-11-25 08:47:46,453 INFO L226 Difference]: Without dead ends: 20592 [2019-11-25 08:47:46,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20592 states. [2019-11-25 08:47:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20592 to 13360. [2019-11-25 08:47:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13360 states. [2019-11-25 08:47:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13360 states to 13360 states and 48401 transitions. [2019-11-25 08:47:47,576 INFO L78 Accepts]: Start accepts. Automaton has 13360 states and 48401 transitions. Word has length 22 [2019-11-25 08:47:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:47,577 INFO L462 AbstractCegarLoop]: Abstraction has 13360 states and 48401 transitions. [2019-11-25 08:47:47,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13360 states and 48401 transitions. [2019-11-25 08:47:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:47:47,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:47,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:47,585 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1619935953, now seen corresponding path program 1 times [2019-11-25 08:47:47,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:47,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851931253] [2019-11-25 08:47:47,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:47,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851931253] [2019-11-25 08:47:47,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:47,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:47,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619418556] [2019-11-25 08:47:47,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:47,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:47,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:47,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:47,674 INFO L87 Difference]: Start difference. First operand 13360 states and 48401 transitions. Second operand 3 states. [2019-11-25 08:47:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:47,814 INFO L93 Difference]: Finished difference Result 13564 states and 46760 transitions. [2019-11-25 08:47:47,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:47,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 08:47:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:47,865 INFO L225 Difference]: With dead ends: 13564 [2019-11-25 08:47:47,866 INFO L226 Difference]: Without dead ends: 13452 [2019-11-25 08:47:47,867 INFO L630 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-11-25 08:47:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13452 states. [2019-11-25 08:47:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13452 to 12840. [2019-11-25 08:47:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12840 states. [2019-11-25 08:47:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12840 states to 12840 states and 44493 transitions. [2019-11-25 08:47:48,366 INFO L78 Accepts]: Start accepts. Automaton has 12840 states and 44493 transitions. Word has length 22 [2019-11-25 08:47:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:48,367 INFO L462 AbstractCegarLoop]: Abstraction has 12840 states and 44493 transitions. [2019-11-25 08:47:48,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 12840 states and 44493 transitions. [2019-11-25 08:47:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:47:48,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:48,369 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:48,369 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash -677431310, now seen corresponding path program 1 times [2019-11-25 08:47:48,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:48,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513967605] [2019-11-25 08:47:48,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:48,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513967605] [2019-11-25 08:47:48,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:48,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:48,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840430174] [2019-11-25 08:47:48,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:48,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:48,491 INFO L87 Difference]: Start difference. First operand 12840 states and 44493 transitions. Second operand 5 states. [2019-11-25 08:47:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:48,728 INFO L93 Difference]: Finished difference Result 19004 states and 64209 transitions. [2019-11-25 08:47:48,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:47:48,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-25 08:47:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:48,798 INFO L225 Difference]: With dead ends: 19004 [2019-11-25 08:47:48,798 INFO L226 Difference]: Without dead ends: 18828 [2019-11-25 08:47:48,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18828 states. [2019-11-25 08:47:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18828 to 13240. [2019-11-25 08:47:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13240 states. [2019-11-25 08:47:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13240 states to 13240 states and 45653 transitions. [2019-11-25 08:47:49,347 INFO L78 Accepts]: Start accepts. Automaton has 13240 states and 45653 transitions. Word has length 26 [2019-11-25 08:47:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:49,348 INFO L462 AbstractCegarLoop]: Abstraction has 13240 states and 45653 transitions. [2019-11-25 08:47:49,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13240 states and 45653 transitions. [2019-11-25 08:47:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:47:49,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:49,357 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:49,357 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:49,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:49,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1293991113, now seen corresponding path program 1 times [2019-11-25 08:47:49,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:49,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470237052] [2019-11-25 08:47:49,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:47:49,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470237052] [2019-11-25 08:47:49,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:49,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:49,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528324804] [2019-11-25 08:47:49,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:49,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:49,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:49,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:49,497 INFO L87 Difference]: Start difference. First operand 13240 states and 45653 transitions. Second operand 5 states. [2019-11-25 08:47:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:49,896 INFO L93 Difference]: Finished difference Result 17748 states and 59714 transitions. [2019-11-25 08:47:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:47:49,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-25 08:47:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:49,945 INFO L225 Difference]: With dead ends: 17748 [2019-11-25 08:47:49,945 INFO L226 Difference]: Without dead ends: 17508 [2019-11-25 08:47:49,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17508 states. [2019-11-25 08:47:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17508 to 12152. [2019-11-25 08:47:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12152 states. [2019-11-25 08:47:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12152 states to 12152 states and 41669 transitions. [2019-11-25 08:47:50,419 INFO L78 Accepts]: Start accepts. Automaton has 12152 states and 41669 transitions. Word has length 30 [2019-11-25 08:47:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:50,420 INFO L462 AbstractCegarLoop]: Abstraction has 12152 states and 41669 transitions. [2019-11-25 08:47:50,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 12152 states and 41669 transitions. [2019-11-25 08:47:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:47:50,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:50,425 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:50,425 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1183132336, now seen corresponding path program 1 times [2019-11-25 08:47:50,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:50,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113177141] [2019-11-25 08:47:50,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:50,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113177141] [2019-11-25 08:47:50,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:50,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:50,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054828163] [2019-11-25 08:47:50,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:50,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:50,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:50,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:50,580 INFO L87 Difference]: Start difference. First operand 12152 states and 41669 transitions. Second operand 7 states. [2019-11-25 08:47:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:51,097 INFO L93 Difference]: Finished difference Result 20136 states and 67331 transitions. [2019-11-25 08:47:51,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:47:51,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-25 08:47:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:51,146 INFO L225 Difference]: With dead ends: 20136 [2019-11-25 08:47:51,147 INFO L226 Difference]: Without dead ends: 19808 [2019-11-25 08:47:51,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:47:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19808 states. [2019-11-25 08:47:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19808 to 12080. [2019-11-25 08:47:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12080 states. [2019-11-25 08:47:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12080 states to 12080 states and 41384 transitions. [2019-11-25 08:47:51,546 INFO L78 Accepts]: Start accepts. Automaton has 12080 states and 41384 transitions. Word has length 30 [2019-11-25 08:47:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:51,547 INFO L462 AbstractCegarLoop]: Abstraction has 12080 states and 41384 transitions. [2019-11-25 08:47:51,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12080 states and 41384 transitions. [2019-11-25 08:47:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:47:51,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:51,551 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:51,557 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash 195092756, now seen corresponding path program 2 times [2019-11-25 08:47:51,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:51,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197630586] [2019-11-25 08:47:51,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:51,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197630586] [2019-11-25 08:47:51,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:51,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:51,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031051865] [2019-11-25 08:47:51,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:51,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:51,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:51,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:51,678 INFO L87 Difference]: Start difference. First operand 12080 states and 41384 transitions. Second operand 7 states. [2019-11-25 08:47:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:52,094 INFO L93 Difference]: Finished difference Result 18356 states and 61317 transitions. [2019-11-25 08:47:52,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:47:52,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-25 08:47:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:52,344 INFO L225 Difference]: With dead ends: 18356 [2019-11-25 08:47:52,345 INFO L226 Difference]: Without dead ends: 18028 [2019-11-25 08:47:52,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:47:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18028 states. [2019-11-25 08:47:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 9840. [2019-11-25 08:47:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9840 states. [2019-11-25 08:47:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9840 states to 9840 states and 33807 transitions. [2019-11-25 08:47:52,672 INFO L78 Accepts]: Start accepts. Automaton has 9840 states and 33807 transitions. Word has length 30 [2019-11-25 08:47:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:52,673 INFO L462 AbstractCegarLoop]: Abstraction has 9840 states and 33807 transitions. [2019-11-25 08:47:52,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9840 states and 33807 transitions. [2019-11-25 08:47:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:47:52,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:52,682 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:52,682 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:52,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1479143721, now seen corresponding path program 1 times [2019-11-25 08:47:52,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:52,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428431556] [2019-11-25 08:47:52,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:47:52,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428431556] [2019-11-25 08:47:52,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:52,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:52,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132626723] [2019-11-25 08:47:52,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:52,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:52,787 INFO L87 Difference]: Start difference. First operand 9840 states and 33807 transitions. Second operand 7 states. [2019-11-25 08:47:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:53,136 INFO L93 Difference]: Finished difference Result 15572 states and 52221 transitions. [2019-11-25 08:47:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:47:53,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-25 08:47:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:53,169 INFO L225 Difference]: With dead ends: 15572 [2019-11-25 08:47:53,169 INFO L226 Difference]: Without dead ends: 15208 [2019-11-25 08:47:53,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:47:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15208 states. [2019-11-25 08:47:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15208 to 9840. [2019-11-25 08:47:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9840 states. [2019-11-25 08:47:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9840 states to 9840 states and 33738 transitions. [2019-11-25 08:47:53,466 INFO L78 Accepts]: Start accepts. Automaton has 9840 states and 33738 transitions. Word has length 34 [2019-11-25 08:47:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:53,466 INFO L462 AbstractCegarLoop]: Abstraction has 9840 states and 33738 transitions. [2019-11-25 08:47:53,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 9840 states and 33738 transitions. [2019-11-25 08:47:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:47:53,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:53,473 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:53,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:53,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1283399737, now seen corresponding path program 1 times [2019-11-25 08:47:53,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:53,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198755019] [2019-11-25 08:47:53,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:47:53,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198755019] [2019-11-25 08:47:53,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:53,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:53,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133694166] [2019-11-25 08:47:53,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:53,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:53,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:53,572 INFO L87 Difference]: Start difference. First operand 9840 states and 33738 transitions. Second operand 7 states. [2019-11-25 08:47:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:53,971 INFO L93 Difference]: Finished difference Result 13128 states and 43664 transitions. [2019-11-25 08:47:53,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:47:53,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-25 08:47:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:54,001 INFO L225 Difference]: With dead ends: 13128 [2019-11-25 08:47:54,001 INFO L226 Difference]: Without dead ends: 12716 [2019-11-25 08:47:54,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:47:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2019-11-25 08:47:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 7412. [2019-11-25 08:47:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7412 states. [2019-11-25 08:47:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 25217 transitions. [2019-11-25 08:47:54,209 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 25217 transitions. Word has length 34 [2019-11-25 08:47:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:54,209 INFO L462 AbstractCegarLoop]: Abstraction has 7412 states and 25217 transitions. [2019-11-25 08:47:54,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 25217 transitions. [2019-11-25 08:47:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:47:54,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:54,215 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:54,215 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:54,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1726791785, now seen corresponding path program 1 times [2019-11-25 08:47:54,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:54,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191973868] [2019-11-25 08:47:54,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:47:54,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191973868] [2019-11-25 08:47:54,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:54,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:54,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73968463] [2019-11-25 08:47:54,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:54,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:54,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:54,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:54,335 INFO L87 Difference]: Start difference. First operand 7412 states and 25217 transitions. Second operand 7 states. [2019-11-25 08:47:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:54,678 INFO L93 Difference]: Finished difference Result 10404 states and 34752 transitions. [2019-11-25 08:47:54,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:47:54,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-25 08:47:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:54,699 INFO L225 Difference]: With dead ends: 10404 [2019-11-25 08:47:54,700 INFO L226 Difference]: Without dead ends: 9928 [2019-11-25 08:47:54,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:47:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9928 states. [2019-11-25 08:47:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9928 to 7464. [2019-11-25 08:47:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7464 states. [2019-11-25 08:47:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7464 states to 7464 states and 25376 transitions. [2019-11-25 08:47:54,887 INFO L78 Accepts]: Start accepts. Automaton has 7464 states and 25376 transitions. Word has length 34 [2019-11-25 08:47:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:54,888 INFO L462 AbstractCegarLoop]: Abstraction has 7464 states and 25376 transitions. [2019-11-25 08:47:54,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7464 states and 25376 transitions. [2019-11-25 08:47:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:47:54,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:54,893 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:54,893 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:54,894 INFO L82 PathProgramCache]: Analyzing trace with hash -386068009, now seen corresponding path program 1 times [2019-11-25 08:47:54,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:54,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818082020] [2019-11-25 08:47:54,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:47:54,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818082020] [2019-11-25 08:47:54,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:54,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:54,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391577924] [2019-11-25 08:47:55,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:55,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:55,001 INFO L87 Difference]: Start difference. First operand 7464 states and 25376 transitions. Second operand 7 states. [2019-11-25 08:47:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:55,338 INFO L93 Difference]: Finished difference Result 6216 states and 20416 transitions. [2019-11-25 08:47:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:47:55,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-25 08:47:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:55,348 INFO L225 Difference]: With dead ends: 6216 [2019-11-25 08:47:55,348 INFO L226 Difference]: Without dead ends: 5804 [2019-11-25 08:47:55,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:47:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-11-25 08:47:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 4628. [2019-11-25 08:47:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4628 states. [2019-11-25 08:47:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 15213 transitions. [2019-11-25 08:47:55,470 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 15213 transitions. Word has length 34 [2019-11-25 08:47:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:55,471 INFO L462 AbstractCegarLoop]: Abstraction has 4628 states and 15213 transitions. [2019-11-25 08:47:55,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 15213 transitions. [2019-11-25 08:47:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:47:55,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:55,476 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:55,476 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash 91106389, now seen corresponding path program 1 times [2019-11-25 08:47:55,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:55,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499528016] [2019-11-25 08:47:55,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 08:47:55,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499528016] [2019-11-25 08:47:55,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:55,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:55,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902517761] [2019-11-25 08:47:55,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:55,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:55,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:55,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:55,507 INFO L87 Difference]: Start difference. First operand 4628 states and 15213 transitions. Second operand 3 states. [2019-11-25 08:47:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:55,539 INFO L93 Difference]: Finished difference Result 1184 states and 2943 transitions. [2019-11-25 08:47:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:55,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 08:47:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:55,542 INFO L225 Difference]: With dead ends: 1184 [2019-11-25 08:47:55,542 INFO L226 Difference]: Without dead ends: 1184 [2019-11-25 08:47:55,542 INFO L630 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-11-25 08:47:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-25 08:47:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2019-11-25 08:47:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-11-25 08:47:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2943 transitions. [2019-11-25 08:47:55,568 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2943 transitions. Word has length 38 [2019-11-25 08:47:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:55,568 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 2943 transitions. [2019-11-25 08:47:55,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2943 transitions. [2019-11-25 08:47:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-25 08:47:55,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:55,571 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:55,571 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1323485815, now seen corresponding path program 1 times [2019-11-25 08:47:55,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:55,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840345625] [2019-11-25 08:47:55,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:55,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:55,695 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:47:55,754 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:47:55,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:55 BasicIcfg [2019-11-25 08:47:55,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:55,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:55,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:55,757 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:55,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:39" (3/4) ... [2019-11-25 08:47:55,760 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:47:55,848 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aff5c7ef-10fc-42eb-8b75-7a97847b43d7/bin/uautomizer/witness.graphml [2019-11-25 08:47:55,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:55,850 INFO L168 Benchmark]: Toolchain (without parser) took 16871.50 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 944.6 MB in the beginning and 768.9 MB in the end (delta: 175.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,851 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:55,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,857 INFO L168 Benchmark]: Boogie Preprocessor took 25.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,857 INFO L168 Benchmark]: RCFGBuilder took 287.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,858 INFO L168 Benchmark]: TraceAbstraction took 15889.95 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 936.9 MB). Free memory was 1.1 GB in the beginning and 776.4 MB in the end (delta: 311.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,858 INFO L168 Benchmark]: Witness Printer took 91.62 ms. Allocated memory is still 2.1 GB. Free memory was 776.4 MB in the beginning and 768.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,860 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 530.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 287.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15889.95 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 936.9 MB). Free memory was 1.1 GB in the beginning and 776.4 MB in the end (delta: 311.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 91.62 ms. Allocated memory is still 2.1 GB. Free memory was 776.4 MB in the beginning and 768.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 698]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L674] 0 volatile unsigned int count = 0; VAL [count=0] [L675] 0 _Bool MTX = 0; VAL [count=0, MTX=0] [L676] 0 _Bool COND = 0; VAL [COND=0, count=0, MTX=0] [L702] 0 pthread_t t; VAL [COND=0, count=0, MTX=0] [L703] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0] [L703] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0] [L703] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0] [L703] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0] [L703] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0] [L703] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0] [L688] CALL 3 __VERIFIER_atomic_acquire() [L680] 3 MTX = 1 [L688] RET 3 __VERIFIER_atomic_acquire() [L689] 3 count++ VAL [COND=0, count=1, MTX=1] [L690] COND FALSE 3 !(count == 3) [L694] CALL 3 __VERIFIER_atomic_release() [L685] 3 MTX = 0 [L694] RET 3 __VERIFIER_atomic_release() [L688] CALL 2 __VERIFIER_atomic_acquire() [L680] 2 MTX = 1 [L688] RET 2 __VERIFIER_atomic_acquire() [L689] 2 count++ VAL [COND=0, count=2, MTX=1] [L690] COND FALSE 2 !(count == 3) [L694] CALL 2 __VERIFIER_atomic_release() [L685] 2 MTX = 0 [L694] RET 2 __VERIFIER_atomic_release() [L688] CALL 1 __VERIFIER_atomic_acquire() [L680] 1 MTX = 1 [L688] RET 1 __VERIFIER_atomic_acquire() [L689] 1 count++ VAL [COND=0, count=3, MTX=1] [L690] COND TRUE 1 count == 3 VAL [COND=0, count=3, MTX=1] [L691] 1 COND = 1 VAL [COND=1, count=3, MTX=1] [L692] 1 count = 0 VAL [COND=1, count=0, MTX=1] [L695] CALL 1 __VERIFIER_atomic_release() [L685] 1 MTX = 0 [L695] RET 1 __VERIFIER_atomic_release() [L698] 1 __VERIFIER_error() VAL [COND=1, count=0, MTX=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 82 locations, 4 error locations. Result: UNSAFE, OverallTime: 15.7s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1464 SDtfs, 2329 SDslu, 3343 SDs, 0 SdLazy, 1244 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39329occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 49016 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 27903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 69/69 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...