./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/stateful_check.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/ldv-regression/stateful_check.c -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 1225f82562543767c482452e9133e4a69d5dae70 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:53:09,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:53:09,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:53:09,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:53:09,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:53:09,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:53:09,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:53:09,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:53:09,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:53:09,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:53:09,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:53:09,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:53:09,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:53:09,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:53:09,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:53:09,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:53:09,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:53:09,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:53:09,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:53:09,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:53:09,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:53:09,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:53:09,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:53:09,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:53:09,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:53:09,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:53:09,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:53:09,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:53:09,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:53:09,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:53:09,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:53:09,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:53:09,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:53:09,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:53:09,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:53:09,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:53:09,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:53:09,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:53:09,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:53:09,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:53:09,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:53:09,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:53:09,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:53:09,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:53:09,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:53:09,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:53:09,400 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:53:09,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:53:09,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:53:09,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:53:09,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:53:09,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:53:09,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:53:09,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:53:09,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:53:09,403 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:53:09,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:53:09,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:53:09,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:53:09,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:53:09,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:53:09,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:53:09,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:53:09,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:53:09,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:53:09,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:53:09,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:53:09,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:53:09,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:53:09,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:53:09,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 -> 1225f82562543767c482452e9133e4a69d5dae70 [2019-11-27 23:53:09,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:53:09,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:53:09,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:53:09,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:53:09,725 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:53:09,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2019-11-27 23:53:09,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03a1b4c3/3263029067ac475ab1f10f81a4a5c36e/FLAG72414ecd2 [2019-11-27 23:53:10,232 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:53:10,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2019-11-27 23:53:10,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03a1b4c3/3263029067ac475ab1f10f81a4a5c36e/FLAG72414ecd2 [2019-11-27 23:53:10,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03a1b4c3/3263029067ac475ab1f10f81a4a5c36e [2019-11-27 23:53:10,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:53:10,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:53:10,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:10,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:53:10,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:53:10,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efb1967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10, skipping insertion in model container [2019-11-27 23:53:10,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:53:10,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:53:10,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:10,829 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:53:10,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:10,862 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:53:10,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10 WrapperNode [2019-11-27 23:53:10,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:10,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:10,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:53:10,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:53:10,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:10,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:53:10,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:53:10,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:53:10,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:53:10,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:53:10,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:53:10,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:53:10,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:53:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:53:11,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:53:11,384 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:53:11,384 INFO L297 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-27 23:53:11,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:11 BoogieIcfgContainer [2019-11-27 23:53:11,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:53:11,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:53:11,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:53:11,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:53:11,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:53:10" (1/3) ... [2019-11-27 23:53:11,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d162e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:11, skipping insertion in model container [2019-11-27 23:53:11,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (2/3) ... [2019-11-27 23:53:11,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d162e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:11, skipping insertion in model container [2019-11-27 23:53:11,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:11" (3/3) ... [2019-11-27 23:53:11,392 INFO L109 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2019-11-27 23:53:11,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:53:11,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-27 23:53:11,415 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-27 23:53:11,438 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:53:11,438 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:53:11,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:53:11,438 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:53:11,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:53:11,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:53:11,439 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:53:11,439 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:53:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-11-27 23:53:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-27 23:53:11,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-27 23:53:11,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash 889605129, now seen corresponding path program 1 times [2019-11-27 23:53:11,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107734511] [2019-11-27 23:53:11,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:11,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107734511] [2019-11-27 23:53:11,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:53:11,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924849556] [2019-11-27 23:53:11,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:53:11,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:53:11,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:53:11,598 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2019-11-27 23:53:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:11,622 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2019-11-27 23:53:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:53:11,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-27 23:53:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:11,636 INFO L225 Difference]: With dead ends: 89 [2019-11-27 23:53:11,637 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 23:53:11,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:53:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 23:53:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-27 23:53:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 23:53:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-27 23:53:11,685 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 6 [2019-11-27 23:53:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:11,685 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-27 23:53:11,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:53:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-27 23:53:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-27 23:53:11,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:11,687 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1804046918, now seen corresponding path program 1 times [2019-11-27 23:53:11,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122703636] [2019-11-27 23:53:11,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:11,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122703636] [2019-11-27 23:53:11,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:53:11,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327496201] [2019-11-27 23:53:11,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:53:11,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:53:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:11,756 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2019-11-27 23:53:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:11,845 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-11-27 23:53:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:53:11,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-27 23:53:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:11,848 INFO L225 Difference]: With dead ends: 70 [2019-11-27 23:53:11,848 INFO L226 Difference]: Without dead ends: 63 [2019-11-27 23:53:11,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-27 23:53:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-27 23:53:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-27 23:53:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2019-11-27 23:53:11,873 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 7 [2019-11-27 23:53:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:11,874 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2019-11-27 23:53:11,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:53:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2019-11-27 23:53:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:53:11,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:11,877 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,878 INFO L82 PathProgramCache]: Analyzing trace with hash -147365405, now seen corresponding path program 1 times [2019-11-27 23:53:11,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288497624] [2019-11-27 23:53:11,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:11,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288497624] [2019-11-27 23:53:11,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:53:11,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012505920] [2019-11-27 23:53:11,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:53:11,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:53:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:11,950 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand 3 states. [2019-11-27 23:53:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,008 INFO L93 Difference]: Finished difference Result 150 states and 212 transitions. [2019-11-27 23:53:12,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:53:12,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 23:53:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,010 INFO L225 Difference]: With dead ends: 150 [2019-11-27 23:53:12,011 INFO L226 Difference]: Without dead ends: 90 [2019-11-27 23:53:12,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-27 23:53:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-11-27 23:53:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-27 23:53:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2019-11-27 23:53:12,024 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 15 [2019-11-27 23:53:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,024 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2019-11-27 23:53:12,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:53:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2019-11-27 23:53:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:53:12,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,025 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:12,026 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1293798555, now seen corresponding path program 1 times [2019-11-27 23:53:12,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705076556] [2019-11-27 23:53:12,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 23:53:12,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705076556] [2019-11-27 23:53:12,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:12,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:53:12,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899030191] [2019-11-27 23:53:12,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:53:12,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:12,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:53:12,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:12,106 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand 3 states. [2019-11-27 23:53:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,146 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2019-11-27 23:53:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:53:12,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 23:53:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,149 INFO L225 Difference]: With dead ends: 208 [2019-11-27 23:53:12,149 INFO L226 Difference]: Without dead ends: 124 [2019-11-27 23:53:12,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-27 23:53:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-11-27 23:53:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-27 23:53:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2019-11-27 23:53:12,181 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 22 [2019-11-27 23:53:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,182 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2019-11-27 23:53:12,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:53:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2019-11-27 23:53:12,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:53:12,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,185 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:12,185 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:12,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1319564790, now seen corresponding path program 1 times [2019-11-27 23:53:12,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936842191] [2019-11-27 23:53:12,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:12,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936842191] [2019-11-27 23:53:12,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513750128] [2019-11-27 23:53:12,256 INFO L94 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 [2019-11-27 23:53:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:53:12,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:12,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:12,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-27 23:53:12,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708886064] [2019-11-27 23:53:12,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:12,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:12,333 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand 5 states. [2019-11-27 23:53:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,430 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2019-11-27 23:53:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:12,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-27 23:53:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,434 INFO L225 Difference]: With dead ends: 344 [2019-11-27 23:53:12,434 INFO L226 Difference]: Without dead ends: 226 [2019-11-27 23:53:12,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-27 23:53:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2019-11-27 23:53:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-27 23:53:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 327 transitions. [2019-11-27 23:53:12,473 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 327 transitions. Word has length 22 [2019-11-27 23:53:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,473 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 327 transitions. [2019-11-27 23:53:12,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 327 transitions. [2019-11-27 23:53:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:53:12,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,476 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:12,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:12,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1040975168, now seen corresponding path program 1 times [2019-11-27 23:53:12,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709969193] [2019-11-27 23:53:12,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 23:53:12,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709969193] [2019-11-27 23:53:12,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:12,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:53:12,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659211854] [2019-11-27 23:53:12,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:53:12,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:53:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:53:12,742 INFO L87 Difference]: Start difference. First operand 217 states and 327 transitions. Second operand 4 states. [2019-11-27 23:53:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,817 INFO L93 Difference]: Finished difference Result 629 states and 979 transitions. [2019-11-27 23:53:12,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:53:12,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-27 23:53:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,823 INFO L225 Difference]: With dead ends: 629 [2019-11-27 23:53:12,823 INFO L226 Difference]: Without dead ends: 415 [2019-11-27 23:53:12,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:53:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-11-27 23:53:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 313. [2019-11-27 23:53:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-27 23:53:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 487 transitions. [2019-11-27 23:53:12,883 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 487 transitions. Word has length 29 [2019-11-27 23:53:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,884 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 487 transitions. [2019-11-27 23:53:12,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:53:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 487 transitions. [2019-11-27 23:53:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 23:53:12,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,889 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:12,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1446791270, now seen corresponding path program 1 times [2019-11-27 23:53:12,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155031570] [2019-11-27 23:53:12,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:53:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:53:12,960 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:53:12,961 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:53:13,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:53:13 BoogieIcfgContainer [2019-11-27 23:53:13,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:53:13,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:53:13,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:53:13,013 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:53:13,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:11" (3/4) ... [2019-11-27 23:53:13,016 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:53:13,085 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:53:13,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:53:13,087 INFO L168 Benchmark]: Toolchain (without parser) took 2466.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 961.7 MB in the beginning and 998.1 MB in the end (delta: -36.4 MB). Peak memory consumption was 92.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:13,088 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:53:13,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:13,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:13,093 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:13,093 INFO L168 Benchmark]: RCFGBuilder took 391.05 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:13,095 INFO L168 Benchmark]: TraceAbstraction took 1625.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.1 MB in the end (delta: 99.8 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:13,096 INFO L168 Benchmark]: Witness Printer took 72.39 ms. Allocated memory is still 1.2 GB. Free memory is still 998.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:53:13,101 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.59 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 391.05 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1625.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.1 MB in the end (delta: 99.8 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.39 ms. Allocated memory is still 1.2 GB. Free memory is still 998.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int ldv_mutex = 1; [L11] int open_called = 0; VAL [ldv_mutex=1, open_called=0] [L74] int ldv_s_misc_fops_file_operations = 0; [L69] open_called = 0 [L70] return 0; VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: VAL [ldv_mutex=1, open_called=0] [L81] COND TRUE ldv_s_misc_fops_file_operations==0 [L57] COND TRUE __VERIFIER_nondet_int() [L59] return 1; VAL [ldv_mutex=1, open_called=0] [L83] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: VAL [ldv_mutex=1, open_called=0] [L89] COND TRUE ldv_s_misc_fops_file_operations==1 [L52] return 0; VAL [ldv_mutex=1, open_called=0] [L91] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: [L96] case 2: VAL [ldv_mutex=1, open_called=0] [L97] COND TRUE ldv_s_misc_fops_file_operations==2 [L48] return 0; VAL [ldv_mutex=1, open_called=0] [L99] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: [L96] case 2: [L104] case 3: VAL [ldv_mutex=1, open_called=0] [L105] COND TRUE ldv_s_misc_fops_file_operations==3 [L34] COND FALSE !(\read(open_called)) VAL [ldv_mutex=1, open_called=0] [L16] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [ldv_mutex=1, open_called=0] [L17] ldv_mutex = 2 VAL [ldv_mutex=2, open_called=0] [L16] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [ldv_mutex=2, open_called=0] [L4] __VERIFIER_error() VAL [ldv_mutex=2, open_called=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 5 error locations. Result: UNSAFE, OverallTime: 1.5s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 297 SDtfs, 164 SDslu, 310 SDs, 0 SdLazy, 98 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 117 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 5084 SizeOfPredicates, 1 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 14/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...