./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-divine/condvar.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/condvar.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 608daa6125fca7edb704aa4fad695d54b285441b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 21:52:56,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 21:52:56,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 21:52:56,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 21:52:56,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 21:52:56,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 21:52:56,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 21:52:56,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 21:52:56,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 21:52:56,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 21:52:56,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 21:52:56,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 21:52:56,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 21:52:56,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 21:52:56,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 21:52:56,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 21:52:56,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 21:52:56,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 21:52:56,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 21:52:56,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 21:52:56,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 21:52:56,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 21:52:56,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 21:52:56,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 21:52:56,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 21:52:56,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 21:52:56,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 21:52:56,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 21:52:56,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 21:52:56,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 21:52:56,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 21:52:56,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 21:52:56,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 21:52:56,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 21:52:56,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 21:52:56,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 21:52:56,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 21:52:56,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 21:52:56,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 21:52:56,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 21:52:56,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 21:52:56,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 21:52:56,397 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 21:52:56,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 21:52:56,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 21:52:56,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 21:52:56,400 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 21:52:56,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 21:52:56,400 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 21:52:56,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 21:52:56,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 21:52:56,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 21:52:56,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 21:52:56,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 21:52:56,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 21:52:56,402 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 21:52:56,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 21:52:56,403 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 21:52:56,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 21:52:56,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 21:52:56,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 21:52:56,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 21:52:56,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 21:52:56,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:52:56,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 21:52:56,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 21:52:56,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 21:52:56,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 21:52:56,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 21:52:56,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 21:52:56,407 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 21:52:56,407 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 608daa6125fca7edb704aa4fad695d54b285441b [2020-07-28 21:52:56,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 21:52:56,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 21:52:56,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 21:52:56,740 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 21:52:56,741 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 21:52:56,742 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/condvar.i [2020-07-28 21:52:56,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353608b2a/2ce7a5c31113401487584b2f2ec39263/FLAG192c483c8 [2020-07-28 21:52:57,376 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 21:52:57,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2020-07-28 21:52:57,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353608b2a/2ce7a5c31113401487584b2f2ec39263/FLAG192c483c8 [2020-07-28 21:52:57,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353608b2a/2ce7a5c31113401487584b2f2ec39263 [2020-07-28 21:52:57,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 21:52:57,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 21:52:57,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 21:52:57,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 21:52:57,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 21:52:57,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:52:57" (1/1) ... [2020-07-28 21:52:57,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b98b30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:57, skipping insertion in model container [2020-07-28 21:52:57,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:52:57" (1/1) ... [2020-07-28 21:52:57,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 21:52:57,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 21:52:57,892 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-07-28 21:52:58,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:52:58,205 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 21:52:58,220 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-07-28 21:52:58,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:52:58,356 INFO L208 MainTranslator]: Completed translation [2020-07-28 21:52:58,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58 WrapperNode [2020-07-28 21:52:58,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 21:52:58,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 21:52:58,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 21:52:58,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 21:52:58,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 21:52:58,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 21:52:58,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 21:52:58,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 21:52:58,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... [2020-07-28 21:52:58,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 21:52:58,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 21:52:58,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 21:52:58,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 21:52:58,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:52:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 21:52:58,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 21:52:58,529 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-07-28 21:52:58,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 21:52:58,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 21:52:58,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-28 21:52:58,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2020-07-28 21:52:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2020-07-28 21:52:58,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 21:52:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 21:52:58,533 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-07-28 21:52:58,951 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 21:52:58,952 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-28 21:52:58,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:52:58 BoogieIcfgContainer [2020-07-28 21:52:58,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 21:52:58,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 21:52:58,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 21:52:58,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 21:52:58,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 09:52:57" (1/3) ... [2020-07-28 21:52:58,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a13ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:52:58, skipping insertion in model container [2020-07-28 21:52:58,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:52:58" (2/3) ... [2020-07-28 21:52:58,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a13ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:52:58, skipping insertion in model container [2020-07-28 21:52:58,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:52:58" (3/3) ... [2020-07-28 21:52:58,965 INFO L109 eAbstractionObserver]: Analyzing ICFG condvar.i [2020-07-28 21:52:58,975 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-07-28 21:52:58,976 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 21:52:58,983 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 21:52:58,984 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-07-28 21:52:59,018 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,019 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,019 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,020 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,020 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,021 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,022 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,023 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,023 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,024 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,028 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,028 WARN L313 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,029 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,029 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,029 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,030 WARN L313 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:52:59,048 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-28 21:52:59,066 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 21:52:59,066 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 21:52:59,066 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 21:52:59,066 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 21:52:59,066 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 21:52:59,067 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 21:52:59,067 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 21:52:59,067 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 21:52:59,081 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 126 flow [2020-07-28 21:52:59,083 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 126 flow [2020-07-28 21:52:59,125 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2020-07-28 21:52:59,126 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-07-28 21:52:59,130 INFO L80 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 58 events. 5/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2020-07-28 21:52:59,133 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 126 flow [2020-07-28 21:52:59,165 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2020-07-28 21:52:59,172 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-07-28 21:52:59,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 58 events. 5/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2020-07-28 21:52:59,176 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 352 [2020-07-28 21:52:59,179 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-07-28 21:53:00,896 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-07-28 21:53:01,439 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2020-07-28 21:53:01,596 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-07-28 21:53:01,601 INFO L206 etLargeBlockEncoding]: Checked pairs total: 294 [2020-07-28 21:53:01,602 INFO L214 etLargeBlockEncoding]: Total number of compositions: 50 [2020-07-28 21:53:01,606 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 14 places, 12 transitions, 32 flow [2020-07-28 21:53:01,615 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16 states. [2020-07-28 21:53:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-28 21:53:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-28 21:53:01,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:53:01,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-28 21:53:01,627 INFO L427 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:53:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:53:01,632 INFO L82 PathProgramCache]: Analyzing trace with hash 7366572, now seen corresponding path program 1 times [2020-07-28 21:53:01,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:53:01,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942419366] [2020-07-28 21:53:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:53:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:01,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {93#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {95#(= ~x_set~0 0)} is VALID [2020-07-28 21:53:01,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#(= ~x_set~0 0)} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {95#(= ~x_set~0 0)} is VALID [2020-07-28 21:53:01,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#(= ~x_set~0 0)} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {95#(= ~x_set~0 0)} is VALID [2020-07-28 21:53:01,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#(= ~x_set~0 0)} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {94#false} is VALID [2020-07-28 21:53:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:53:01,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942419366] [2020-07-28 21:53:01,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:53:01,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-28 21:53:01,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148356773] [2020-07-28 21:53:01,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-28 21:53:01,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:53:01,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 21:53:01,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:01,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 21:53:01,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:53:01,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 21:53:01,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:53:01,942 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2020-07-28 21:53:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,004 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-28 21:53:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 21:53:02,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-28 21:53:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:53:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:53:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2020-07-28 21:53:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:53:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2020-07-28 21:53:02,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2020-07-28 21:53:02,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:02,052 INFO L225 Difference]: With dead ends: 12 [2020-07-28 21:53:02,053 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 21:53:02,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:53:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 21:53:02,077 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,079 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,079 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,080 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,080 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,080 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,080 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,081 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,081 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 21:53:02,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:53:02,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 21:53:02,083 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 21:53:02,083 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 21:53:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,086 INFO L93 Difference]: Finished difference Result 9 states and 15 transitions. [2020-07-28 21:53:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2020-07-28 21:53:02,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:02,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:02,086 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 21:53:02,087 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 21:53:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,088 INFO L93 Difference]: Finished difference Result 9 states and 15 transitions. [2020-07-28 21:53:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2020-07-28 21:53:02,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:02,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:02,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:53:02,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:53:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 21:53:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2020-07-28 21:53:02,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 4 [2020-07-28 21:53:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:53:02,093 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2020-07-28 21:53:02,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 21:53:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2020-07-28 21:53:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 21:53:02,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:53:02,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 21:53:02,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 21:53:02,094 INFO L427 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:53:02,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:53:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1511130461, now seen corresponding path program 1 times [2020-07-28 21:53:02,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:53:02,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746201014] [2020-07-28 21:53:02,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:53:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:02,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {146#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {146#true} is VALID [2020-07-28 21:53:02,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#true} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {146#true} is VALID [2020-07-28 21:53:02,183 INFO L280 TraceCheckUtils]: 2: Hoare triple {146#true} [180] L701-1-->L702-6: Formula: (= 0 v_ULTIMATE.start_main_~i~0_17) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~i~0] {148#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:02,187 INFO L280 TraceCheckUtils]: 3: Hoare triple {148#(= 0 ULTIMATE.start_main_~i~0)} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {148#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:02,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {148#(= 0 ULTIMATE.start_main_~i~0)} [189] L702-6-->L706-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_8| (select (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t~0.base_11|) |v_ULTIMATE.start_main_~#t~0.offset_10|)) (not (<= v_ULTIMATE.start_main_~i~0_26 42)) (= 1 v_~x_set~0_18)) InVars {#memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ~x_set~0=v_~x_set~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ~x_set~0] {147#false} is VALID [2020-07-28 21:53:02,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {147#false} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {147#false} is VALID [2020-07-28 21:53:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:53:02,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746201014] [2020-07-28 21:53:02,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:53:02,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:53:02,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663998099] [2020-07-28 21:53:02,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 21:53:02,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:53:02,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 21:53:02,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:02,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 21:53:02,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:53:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 21:53:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:53:02,216 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 3 states. [2020-07-28 21:53:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,246 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2020-07-28 21:53:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 21:53:02,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 21:53:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:53:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:53:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-28 21:53:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:53:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-28 21:53:02,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2020-07-28 21:53:02,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:02,268 INFO L225 Difference]: With dead ends: 11 [2020-07-28 21:53:02,269 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 21:53:02,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:53:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 21:53:02,271 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,272 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,272 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,272 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,273 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,273 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,273 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,274 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,274 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,274 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,274 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-28 21:53:02,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:53:02,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-28 21:53:02,276 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 21:53:02,276 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 21:53:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,278 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2020-07-28 21:53:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2020-07-28 21:53:02,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:02,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:02,279 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 21:53:02,279 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 21:53:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,281 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2020-07-28 21:53:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2020-07-28 21:53:02,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:02,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:02,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:53:02,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:53:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 21:53:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2020-07-28 21:53:02,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 6 [2020-07-28 21:53:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:53:02,285 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2020-07-28 21:53:02,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 21:53:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2020-07-28 21:53:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 21:53:02,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:53:02,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:53:02,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 21:53:02,287 INFO L427 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:53:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:53:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 399613212, now seen corresponding path program 1 times [2020-07-28 21:53:02,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:53:02,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203276293] [2020-07-28 21:53:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:53:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:02,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {206#true} is VALID [2020-07-28 21:53:02,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {206#true} is VALID [2020-07-28 21:53:02,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} [180] L701-1-->L702-6: Formula: (= 0 v_ULTIMATE.start_main_~i~0_17) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~i~0] {208#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:02,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {208#(= 0 ULTIMATE.start_main_~i~0)} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {208#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:02,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {208#(= 0 ULTIMATE.start_main_~i~0)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {209#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 21:53:02,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {209#(<= ULTIMATE.start_main_~i~0 1)} [189] L702-6-->L706-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_8| (select (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t~0.base_11|) |v_ULTIMATE.start_main_~#t~0.offset_10|)) (not (<= v_ULTIMATE.start_main_~i~0_26 42)) (= 1 v_~x_set~0_18)) InVars {#memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ~x_set~0=v_~x_set~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ~x_set~0] {207#false} is VALID [2020-07-28 21:53:02,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#false} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {207#false} is VALID [2020-07-28 21:53:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:53:02,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203276293] [2020-07-28 21:53:02,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637276690] [2020-07-28 21:53:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 21:53:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:02,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 21:53:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:02,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 21:53:02,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {206#true} is VALID [2020-07-28 21:53:02,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {206#true} is VALID [2020-07-28 21:53:02,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} [180] L701-1-->L702-6: Formula: (= 0 v_ULTIMATE.start_main_~i~0_17) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~i~0] {219#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 21:53:02,525 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#(<= ULTIMATE.start_main_~i~0 0)} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {219#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 21:53:02,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#(<= ULTIMATE.start_main_~i~0 0)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {209#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 21:53:02,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {209#(<= ULTIMATE.start_main_~i~0 1)} [189] L702-6-->L706-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_8| (select (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t~0.base_11|) |v_ULTIMATE.start_main_~#t~0.offset_10|)) (not (<= v_ULTIMATE.start_main_~i~0_26 42)) (= 1 v_~x_set~0_18)) InVars {#memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ~x_set~0=v_~x_set~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ~x_set~0] {207#false} is VALID [2020-07-28 21:53:02,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#false} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {207#false} is VALID [2020-07-28 21:53:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:53:02,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 21:53:02,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 21:53:02,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225883614] [2020-07-28 21:53:02,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-28 21:53:02,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:53:02,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 21:53:02,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:02,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 21:53:02,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:53:02,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 21:53:02,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:53:02,546 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 5 states. [2020-07-28 21:53:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,602 INFO L93 Difference]: Finished difference Result 13 states and 23 transitions. [2020-07-28 21:53:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:53:02,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-28 21:53:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:53:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:53:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 21:53:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:53:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 21:53:02,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2020-07-28 21:53:02,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:02,630 INFO L225 Difference]: With dead ends: 13 [2020-07-28 21:53:02,630 INFO L226 Difference]: Without dead ends: 13 [2020-07-28 21:53:02,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:53:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-28 21:53:02,632 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,632 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,632 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,633 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,633 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,633 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,633 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,633 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,634 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,634 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,634 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,634 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,634 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-28 21:53:02,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:53:02,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-28 21:53:02,635 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 21:53:02,635 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 21:53:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,637 INFO L93 Difference]: Finished difference Result 13 states and 23 transitions. [2020-07-28 21:53:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-07-28 21:53:02,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:02,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:02,638 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 21:53:02,638 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 21:53:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:02,640 INFO L93 Difference]: Finished difference Result 13 states and 23 transitions. [2020-07-28 21:53:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-07-28 21:53:02,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:02,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:02,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:53:02,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:53:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 21:53:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-07-28 21:53:02,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 7 [2020-07-28 21:53:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:53:02,643 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-07-28 21:53:02,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 21:53:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-07-28 21:53:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 21:53:02,644 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:53:02,644 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-28 21:53:02,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 21:53:02,849 INFO L427 AbstractCegarLoop]: === Iteration 4 === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:53:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:53:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash -496875069, now seen corresponding path program 2 times [2020-07-28 21:53:02,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:53:02,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106220466] [2020-07-28 21:53:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:53:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:02,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {296#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {296#true} is VALID [2020-07-28 21:53:02,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {296#true} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {296#true} is VALID [2020-07-28 21:53:02,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {296#true} [180] L701-1-->L702-6: Formula: (= 0 v_ULTIMATE.start_main_~i~0_17) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~i~0] {298#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:02,973 INFO L280 TraceCheckUtils]: 3: Hoare triple {298#(= 0 ULTIMATE.start_main_~i~0)} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {298#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:02,974 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(= 0 ULTIMATE.start_main_~i~0)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {299#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 21:53:02,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(<= ULTIMATE.start_main_~i~0 1)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {300#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 21:53:02,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {300#(<= ULTIMATE.start_main_~i~0 2)} [189] L702-6-->L706-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_8| (select (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t~0.base_11|) |v_ULTIMATE.start_main_~#t~0.offset_10|)) (not (<= v_ULTIMATE.start_main_~i~0_26 42)) (= 1 v_~x_set~0_18)) InVars {#memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ~x_set~0=v_~x_set~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ~x_set~0] {297#false} is VALID [2020-07-28 21:53:02,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {297#false} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {297#false} is VALID [2020-07-28 21:53:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:53:02,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106220466] [2020-07-28 21:53:02,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743917642] [2020-07-28 21:53:02,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 21:53:03,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 21:53:03,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 21:53:03,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 21:53:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:03,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 21:53:03,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {296#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {296#true} is VALID [2020-07-28 21:53:03,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {296#true} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {296#true} is VALID [2020-07-28 21:53:03,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {296#true} [180] L701-1-->L702-6: Formula: (= 0 v_ULTIMATE.start_main_~i~0_17) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~i~0] {310#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 21:53:03,128 INFO L280 TraceCheckUtils]: 3: Hoare triple {310#(<= ULTIMATE.start_main_~i~0 0)} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {310#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-28 21:53:03,129 INFO L280 TraceCheckUtils]: 4: Hoare triple {310#(<= ULTIMATE.start_main_~i~0 0)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {299#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 21:53:03,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(<= ULTIMATE.start_main_~i~0 1)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {300#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 21:53:03,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {300#(<= ULTIMATE.start_main_~i~0 2)} [189] L702-6-->L706-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_8| (select (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t~0.base_11|) |v_ULTIMATE.start_main_~#t~0.offset_10|)) (not (<= v_ULTIMATE.start_main_~i~0_26 42)) (= 1 v_~x_set~0_18)) InVars {#memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ~x_set~0=v_~x_set~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ~x_set~0] {297#false} is VALID [2020-07-28 21:53:03,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {297#false} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {297#false} is VALID [2020-07-28 21:53:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:53:03,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 21:53:03,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 21:53:03,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103732323] [2020-07-28 21:53:03,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-28 21:53:03,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:53:03,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 21:53:03,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:03,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 21:53:03,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:53:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 21:53:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 21:53:03,158 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 6 states. [2020-07-28 21:53:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:03,226 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. [2020-07-28 21:53:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 21:53:03,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-28 21:53:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:53:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 21:53:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-28 21:53:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 21:53:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-28 21:53:03,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2020-07-28 21:53:03,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:03,265 INFO L225 Difference]: With dead ends: 15 [2020-07-28 21:53:03,265 INFO L226 Difference]: Without dead ends: 15 [2020-07-28 21:53:03,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 21:53:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-28 21:53:03,267 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,268 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,268 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,268 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,268 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,269 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,269 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,269 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,269 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,270 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,270 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,270 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,270 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,271 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,271 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:53:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-28 21:53:03,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:53:03,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-28 21:53:03,272 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 21:53:03,272 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 21:53:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:03,274 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. [2020-07-28 21:53:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2020-07-28 21:53:03,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:03,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:03,275 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 21:53:03,275 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 21:53:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:03,277 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. [2020-07-28 21:53:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2020-07-28 21:53:03,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:03,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:03,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:53:03,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:53:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 21:53:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2020-07-28 21:53:03,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 8 [2020-07-28 21:53:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:53:03,280 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2020-07-28 21:53:03,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 21:53:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2020-07-28 21:53:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 21:53:03,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:53:03,281 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2020-07-28 21:53:03,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 21:53:03,494 INFO L427 AbstractCegarLoop]: === Iteration 5 === [threadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:53:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:53:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1776759292, now seen corresponding path program 3 times [2020-07-28 21:53:03,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:53:03,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095122948] [2020-07-28 21:53:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:53:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:03,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {400#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {400#true} is VALID [2020-07-28 21:53:03,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {400#true} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {400#true} is VALID [2020-07-28 21:53:03,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {400#true} [180] L701-1-->L702-6: Formula: (= 0 v_ULTIMATE.start_main_~i~0_17) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~i~0] {402#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:03,572 INFO L280 TraceCheckUtils]: 3: Hoare triple {402#(= 0 ULTIMATE.start_main_~i~0)} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {402#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 21:53:03,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {402#(= 0 ULTIMATE.start_main_~i~0)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {403#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 21:53:03,574 INFO L280 TraceCheckUtils]: 5: Hoare triple {403#(<= ULTIMATE.start_main_~i~0 1)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {404#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 21:53:03,575 INFO L280 TraceCheckUtils]: 6: Hoare triple {404#(<= ULTIMATE.start_main_~i~0 2)} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {405#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 21:53:03,576 INFO L280 TraceCheckUtils]: 7: Hoare triple {405#(<= ULTIMATE.start_main_~i~0 3)} [189] L702-6-->L706-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_8| (select (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t~0.base_11|) |v_ULTIMATE.start_main_~#t~0.offset_10|)) (not (<= v_ULTIMATE.start_main_~i~0_26 42)) (= 1 v_~x_set~0_18)) InVars {#memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ~x_set~0=v_~x_set~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ~x_set~0] {401#false} is VALID [2020-07-28 21:53:03,577 INFO L280 TraceCheckUtils]: 8: Hoare triple {401#false} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {401#false} is VALID [2020-07-28 21:53:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:53:03,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095122948] [2020-07-28 21:53:03,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299125956] [2020-07-28 21:53:03,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 21:53:03,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-28 21:53:03,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 21:53:03,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 21:53:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:53:03,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 21:53:03,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {400#true} [211] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse3 (store |v_#valid_41| 0 0))) (let ((.cse4 (store .cse3 |v_~#lock~0.base_35| 1))) (let ((.cse0 (select |v_#memory_int_40| |v_~#lock~0.base_35|)) (.cse1 (store .cse4 |v_~#cond~0.base_22| 1)) (.cse2 (select |v_#memory_int_40| |v_~#cond~0.base_22|))) (and (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 8))) (= (store .cse1 |v_ULTIMATE.start_main_~#t~0.base_19| 1) |v_#valid_39|) (= (store (store (store |v_#length_30| |v_~#lock~0.base_35| 24) |v_~#cond~0.base_22| 48) |v_ULTIMATE.start_main_~#t~0.base_19| 4) |v_#length_28|) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 20))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 24))) (= 0 (select .cse0 |v_~#lock~0.offset_35|)) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_~#cond~0.base_22|) (= 0 |v_~#lock~0.offset_35|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 28))) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 4))) (= 0 (select .cse3 |v_~#lock~0.base_35|)) (= 0 (select .cse0 (+ |v_~#lock~0.offset_35| 12))) (= 0 |v_#NULL.offset_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t~0.base_19|) (= 0 |v_~#cond~0.offset_22|) (< |v_#StackHeapBarrier_15| |v_~#lock~0.base_35|) (= 0 (select .cse2 |v_~#cond~0.offset_22|)) (= 0 v_~x_set~0_40) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 8))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t~0.base_19|) |v_ULTIMATE.start_main_~#t~0.offset_17| 0)) |v_#memory_int_39|) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 16))) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 4))) (= (select .cse4 |v_~#cond~0.base_22|) 0) (= |v_ULTIMATE.start_main_~#t~0.offset_17| 0) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t~0.base_19|)) (= 0 (select .cse2 (+ |v_~#cond~0.offset_22| 12))) (= 0 v_~x~0_33) (< 0 |v_#StackHeapBarrier_15|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_40|, #length=|v_#length_30|} OutVars{~#lock~0.base=|v_~#lock~0.base_35|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ~#cond~0.offset=|v_~#cond~0.offset_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_41, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_17|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_12|, #NULL.base=|v_#NULL.base_6|, ~#cond~0.base=|v_~#cond~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_39|, ~#lock~0.offset=|v_~#lock~0.offset_35|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_19|, #length=|v_#length_28|, ~x_set~0=v_~x_set~0_40, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~#lock~0.base, ULTIMATE.start_main_#t~nondet5, ~#cond~0.offset, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#t~0.offset, ULTIMATE.start_main_#t~post6, #NULL.base, ~#cond~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ~#lock~0.offset, ULTIMATE.start_main_~#t~0.base, #length, ~x_set~0, ~x~0] {400#true} is VALID [2020-07-28 21:53:03,697 INFO L280 TraceCheckUtils]: 1: Hoare triple {400#true} [157] L701-->threadENTRY: Formula: (and (= 0 |v_threadThread1of1ForFork0_#in~arg.offset_3|) (= 0 |v_threadThread1of1ForFork0_#in~arg.base_3|) (= 0 v_threadThread1of1ForFork0_thidvar0_2)) InVars {} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_3|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_3, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_3, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_3|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_4|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_3|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#t~nondet4, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~nondet3, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base] {400#true} is VALID [2020-07-28 21:53:03,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {400#true} [180] L701-1-->L702-6: Formula: (= 0 v_ULTIMATE.start_main_~i~0_17) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~i~0] {400#true} is VALID [2020-07-28 21:53:03,698 INFO L280 TraceCheckUtils]: 3: Hoare triple {400#true} [196] threadENTRY-->L693-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_31| |v_~#lock~0.base_27|))) (and (= v_threadThread1of1ForFork0_~arg.base_4 |v_threadThread1of1ForFork0_#in~arg.base_4|) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| v_threadThread1of1ForFork0_~arg.offset_4) (= 0 (select .cse0 |v_~#lock~0.offset_27|)) (= (store |v_#pthreadsMutex_31| |v_~#lock~0.base_27| (store .cse0 |v_~#lock~0.offset_27| 1)) |v_#pthreadsMutex_30|))) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#lock~0.base=|v_~#lock~0.base_27|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_30|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, ~#lock~0.base=|v_~#lock~0.base_27|, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#t~nondet3=|v_threadThread1of1ForFork0_#t~nondet3_7|, ~#lock~0.offset=|v_~#lock~0.offset_27|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#t~nondet3] {400#true} is VALID [2020-07-28 21:53:03,698 INFO L280 TraceCheckUtils]: 4: Hoare triple {400#true} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {400#true} is VALID [2020-07-28 21:53:03,699 INFO L280 TraceCheckUtils]: 5: Hoare triple {400#true} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {400#true} is VALID [2020-07-28 21:53:03,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {400#true} [207] L702-6-->L702-6: Formula: (and (= v_~x~0_31 v_ULTIMATE.start_main_~i~0_39) (= (+ v_ULTIMATE.start_main_~i~0_38 (- 1)) v_ULTIMATE.start_main_~i~0_39) (<= v_ULTIMATE.start_main_~i~0_39 42)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_39} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_38, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_10|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6, ~x~0] {427#(and (<= ULTIMATE.start_main_~i~0 (+ ~x~0 1)) (<= ~x~0 42))} is VALID [2020-07-28 21:53:03,707 INFO L280 TraceCheckUtils]: 7: Hoare triple {427#(and (<= ULTIMATE.start_main_~i~0 (+ ~x~0 1)) (<= ~x~0 42))} [189] L702-6-->L706-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem7_8| (select (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t~0.base_11|) |v_ULTIMATE.start_main_~#t~0.offset_10|)) (not (<= v_ULTIMATE.start_main_~i~0_26 42)) (= 1 v_~x_set~0_18)) InVars {#memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_11|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_26, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ~x_set~0=v_~x_set~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ~x_set~0] {431#(and (<= 42 ~x~0) (<= ~x~0 42))} is VALID [2020-07-28 21:53:03,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {431#(and (<= 42 ~x~0) (<= ~x~0 42))} [197] L693-2-->threadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 42 v_~x~0_20)) (not (= (mod v_~x_set~0_23 256) 0))) InVars {~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} OutVars{~x_set~0=v_~x_set~0_23, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[] {401#false} is VALID [2020-07-28 21:53:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-28 21:53:03,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 21:53:03,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2020-07-28 21:53:03,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326030723] [2020-07-28 21:53:03,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 21:53:03,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:53:03,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:53:03,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:03,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:53:03,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:53:03,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:53:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 21:53:03,726 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 4 states. [2020-07-28 21:53:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:03,789 INFO L93 Difference]: Finished difference Result 14 states and 26 transitions. [2020-07-28 21:53:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:53:03,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 21:53:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:53:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:53:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-28 21:53:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:53:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-28 21:53:03,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2020-07-28 21:53:03,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:53:03,810 INFO L225 Difference]: With dead ends: 14 [2020-07-28 21:53:03,811 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 21:53:03,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-28 21:53:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 21:53:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 21:53:03,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:53:03,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 21:53:03,812 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:53:03,812 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:53:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:03,812 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:53:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:53:03,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:03,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:03,813 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:53:03,813 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:53:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:53:03,813 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:53:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:53:03,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:03,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:53:03,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:53:03,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:53:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 21:53:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 21:53:03,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2020-07-28 21:53:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:53:03,815 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 21:53:03,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:53:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:53:03,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:53:04,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 21:53:04,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 09:53:04 BasicIcfg [2020-07-28 21:53:04,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 21:53:04,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 21:53:04,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 21:53:04,032 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 21:53:04,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:52:58" (3/4) ... [2020-07-28 21:53:04,036 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 21:53:04,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread [2020-07-28 21:53:04,048 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-28 21:53:04,048 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 21:53:04,049 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 21:53:04,096 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 21:53:04,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 21:53:04,099 INFO L168 Benchmark]: Toolchain (without parser) took 6457.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 956.2 MB in the beginning and 926.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 236.6 MB. Max. memory is 11.5 GB. [2020-07-28 21:53:04,099 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:53:04,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-28 21:53:04,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:53:04,101 INFO L168 Benchmark]: Boogie Preprocessor took 33.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:53:04,101 INFO L168 Benchmark]: RCFGBuilder took 508.84 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2020-07-28 21:53:04,102 INFO L168 Benchmark]: TraceAbstraction took 5073.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 926.7 MB in the end (delta: 147.9 MB). Peak memory consumption was 216.1 MB. Max. memory is 11.5 GB. [2020-07-28 21:53:04,102 INFO L168 Benchmark]: Witness Printer took 64.95 ms. Allocated memory is still 1.2 GB. Free memory is still 926.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:53:04,105 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 712.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 508.84 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5073.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 926.7 MB in the end (delta: 147.9 MB). Peak memory consumption was 216.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.95 ms. Allocated memory is still 1.2 GB. Free memory is still 926.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 58 ProgramPointsBefore, 14 ProgramPointsAfterwards, 59 TransitionsBefore, 12 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 190 VarBasedMoverChecksPositive, 9 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 8 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 294 CheckedPairsTotal, 50 TotalNumberOfCompositions - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 47 SDtfs, 20 SDslu, 44 SDs, 0 SdLazy, 34 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 58 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 746 SizeOfPredicates, 3 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...