java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:06:19,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:06:19,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:06:19,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:06:19,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:06:19,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:06:19,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:06:19,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:06:19,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:06:19,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:06:19,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:06:19,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:06:19,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:06:19,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:06:19,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:06:19,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:06:19,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:06:19,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:06:19,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:06:19,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:06:19,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:06:19,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:06:19,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:06:19,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:06:19,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:06:19,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:06:19,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:06:19,909 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:06:19,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:06:19,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:06:19,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:06:19,910 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:06:19,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:06:19,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:06:19,921 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:06:19,922 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:06:19,922 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:06:19,922 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:06:19,922 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:06:19,923 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:06:19,923 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:06:19,923 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:06:19,924 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:06:19,924 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:06:19,924 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:06:19,924 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:06:19,924 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:06:19,925 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:06:19,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:06:19,925 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:06:19,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:06:19,925 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:06:19,926 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:06:19,926 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:06:19,926 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:06:19,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:06:19,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:06:19,927 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:06:19,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:06:19,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:06:19,927 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:06:19,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:06:19,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:06:19,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:06:19,929 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:06:19,929 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:06:19,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:06:19,970 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:06:19,973 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:06:19,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:06:19,975 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:06:19,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-01-29 23:06:20,158 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:06:20,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:06:20,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:06:20,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:06:20,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:06:20,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef5d6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20, skipping insertion in model container [2018-01-29 23:06:20,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,203 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:06:20,247 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:06:20,375 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:06:20,398 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:06:20,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20 WrapperNode [2018-01-29 23:06:20,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:06:20,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:06:20,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:06:20,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:06:20,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... [2018-01-29 23:06:20,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:06:20,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:06:20,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:06:20,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:06:20,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (1/1) ... No working directory specified, using /storage/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 [2018-01-29 23:06:20,494 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:06:20,494 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:06:20,494 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-29 23:06:20,495 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-29 23:06:20,495 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:06:20,495 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:06:20,495 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:06:20,495 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:06:20,495 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:06:20,495 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:06:20,496 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:06:20,496 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:06:20,496 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:06:20,496 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:06:20,496 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:06:20,496 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-29 23:06:20,497 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-29 23:06:20,497 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:06:20,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:06:20,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:06:20,902 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:06:20,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:06:20 BoogieIcfgContainer [2018-01-29 23:06:20,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:06:20,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:06:20,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:06:20,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:06:20,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:06:20" (1/3) ... [2018-01-29 23:06:20,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397dc0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:06:20, skipping insertion in model container [2018-01-29 23:06:20,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:06:20" (2/3) ... [2018-01-29 23:06:20,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397dc0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:06:20, skipping insertion in model container [2018-01-29 23:06:20,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:06:20" (3/3) ... [2018-01-29 23:06:20,912 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-01-29 23:06:20,922 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:06:20,930 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-29 23:06:20,983 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:06:20,983 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:06:20,984 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:06:20,984 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:06:20,984 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:06:20,984 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:06:20,984 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:06:20,984 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:06:20,985 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:06:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-29 23:06:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:06:21,017 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:21,018 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:21,019 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1543413146, now seen corresponding path program 1 times [2018-01-29 23:06:21,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:21,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:21,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:21,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:21,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:21,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:21,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:06:21,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:06:21,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:06:21,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:06:21,306 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-29 23:06:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:21,407 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2018-01-29 23:06:21,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:06:21,408 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-29 23:06:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:21,419 INFO L225 Difference]: With dead ends: 149 [2018-01-29 23:06:21,420 INFO L226 Difference]: Without dead ends: 124 [2018-01-29 23:06:21,423 INFO L553 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 [2018-01-29 23:06:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-29 23:06:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-29 23:06:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-29 23:06:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-01-29 23:06:21,462 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 19 [2018-01-29 23:06:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:21,463 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-01-29 23:06:21,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:06:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-01-29 23:06:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:06:21,463 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:21,464 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:21,464 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash 883750857, now seen corresponding path program 1 times [2018-01-29 23:06:21,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:21,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:21,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:21,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:21,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:21,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:21,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:06:21,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:06:21,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:06:21,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:06:21,563 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 3 states. [2018-01-29 23:06:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:21,594 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2018-01-29 23:06:21,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:06:21,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-29 23:06:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:21,597 INFO L225 Difference]: With dead ends: 146 [2018-01-29 23:06:21,597 INFO L226 Difference]: Without dead ends: 125 [2018-01-29 23:06:21,598 INFO L553 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 [2018-01-29 23:06:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-29 23:06:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-29 23:06:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-29 23:06:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2018-01-29 23:06:21,612 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 24 [2018-01-29 23:06:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:21,612 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2018-01-29 23:06:21,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:06:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-01-29 23:06:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:06:21,613 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:21,614 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:21,614 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:21,614 INFO L82 PathProgramCache]: Analyzing trace with hash -783947252, now seen corresponding path program 1 times [2018-01-29 23:06:21,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:21,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:21,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:21,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:21,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:21,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:21,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:06:21,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:06:21,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:06:21,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:06:21,722 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 3 states. [2018-01-29 23:06:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:21,760 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-01-29 23:06:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:06:21,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-29 23:06:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:21,763 INFO L225 Difference]: With dead ends: 236 [2018-01-29 23:06:21,763 INFO L226 Difference]: Without dead ends: 217 [2018-01-29 23:06:21,764 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:06:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-29 23:06:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 198. [2018-01-29 23:06:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-29 23:06:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-01-29 23:06:21,783 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 26 [2018-01-29 23:06:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:21,784 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-01-29 23:06:21,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:06:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-01-29 23:06:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:06:21,785 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:21,786 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:21,786 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1866928143, now seen corresponding path program 1 times [2018-01-29 23:06:21,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:21,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:21,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:21,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:21,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:21,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:21,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:06:21,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:06:21,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:06:21,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:06:21,858 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 4 states. [2018-01-29 23:06:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:22,066 INFO L93 Difference]: Finished difference Result 371 states and 462 transitions. [2018-01-29 23:06:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:06:22,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-29 23:06:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:22,070 INFO L225 Difference]: With dead ends: 371 [2018-01-29 23:06:22,070 INFO L226 Difference]: Without dead ends: 367 [2018-01-29 23:06:22,071 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:06:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-01-29 23:06:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 332. [2018-01-29 23:06:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-29 23:06:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 424 transitions. [2018-01-29 23:06:22,102 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 424 transitions. Word has length 32 [2018-01-29 23:06:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:22,103 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 424 transitions. [2018-01-29 23:06:22,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:06:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 424 transitions. [2018-01-29 23:06:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:06:22,104 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:22,104 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:22,105 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:22,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1866928144, now seen corresponding path program 1 times [2018-01-29 23:06:22,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:22,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:22,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:22,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:22,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:22,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:22,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:22,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:06:22,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:06:22,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:06:22,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:06:22,192 INFO L87 Difference]: Start difference. First operand 332 states and 424 transitions. Second operand 4 states. [2018-01-29 23:06:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:22,565 INFO L93 Difference]: Finished difference Result 504 states and 640 transitions. [2018-01-29 23:06:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:06:22,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-29 23:06:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:22,570 INFO L225 Difference]: With dead ends: 504 [2018-01-29 23:06:22,570 INFO L226 Difference]: Without dead ends: 500 [2018-01-29 23:06:22,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:06:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-01-29 23:06:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 470. [2018-01-29 23:06:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-01-29 23:06:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 607 transitions. [2018-01-29 23:06:22,615 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 607 transitions. Word has length 32 [2018-01-29 23:06:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:22,617 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 607 transitions. [2018-01-29 23:06:22,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:06:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 607 transitions. [2018-01-29 23:06:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:06:22,618 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:22,619 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:22,619 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:22,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1867205263, now seen corresponding path program 1 times [2018-01-29 23:06:22,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:22,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:22,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:22,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:22,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:22,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:22,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:22,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:06:22,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:06:22,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:06:22,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:06:22,735 INFO L87 Difference]: Start difference. First operand 470 states and 607 transitions. Second operand 6 states. [2018-01-29 23:06:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:22,994 INFO L93 Difference]: Finished difference Result 1328 states and 1737 transitions. [2018-01-29 23:06:22,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:06:22,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-29 23:06:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:23,001 INFO L225 Difference]: With dead ends: 1328 [2018-01-29 23:06:23,001 INFO L226 Difference]: Without dead ends: 873 [2018-01-29 23:06:23,005 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:06:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-01-29 23:06:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 836. [2018-01-29 23:06:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-01-29 23:06:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1076 transitions. [2018-01-29 23:06:23,062 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1076 transitions. Word has length 32 [2018-01-29 23:06:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:23,062 INFO L432 AbstractCegarLoop]: Abstraction has 836 states and 1076 transitions. [2018-01-29 23:06:23,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:06:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1076 transitions. [2018-01-29 23:06:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:06:23,064 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:23,064 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:23,064 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash -756017955, now seen corresponding path program 1 times [2018-01-29 23:06:23,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:23,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:23,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:23,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:23,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:23,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:23,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:23,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:06:23,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:06:23,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:06:23,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:06:23,136 INFO L87 Difference]: Start difference. First operand 836 states and 1076 transitions. Second operand 3 states. [2018-01-29 23:06:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:23,215 INFO L93 Difference]: Finished difference Result 860 states and 1100 transitions. [2018-01-29 23:06:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:06:23,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-29 23:06:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:23,222 INFO L225 Difference]: With dead ends: 860 [2018-01-29 23:06:23,222 INFO L226 Difference]: Without dead ends: 848 [2018-01-29 23:06:23,223 INFO L553 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 [2018-01-29 23:06:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-01-29 23:06:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 836. [2018-01-29 23:06:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-01-29 23:06:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1072 transitions. [2018-01-29 23:06:23,262 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1072 transitions. Word has length 32 [2018-01-29 23:06:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:23,263 INFO L432 AbstractCegarLoop]: Abstraction has 836 states and 1072 transitions. [2018-01-29 23:06:23,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:06:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1072 transitions. [2018-01-29 23:06:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:06:23,264 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:23,264 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:23,264 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash 13497930, now seen corresponding path program 1 times [2018-01-29 23:06:23,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:23,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:23,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:23,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:23,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:23,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:23,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:06:23,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:06:23,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:06:23,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:06:23,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:06:23,376 INFO L87 Difference]: Start difference. First operand 836 states and 1072 transitions. Second operand 6 states. [2018-01-29 23:06:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:23,512 INFO L93 Difference]: Finished difference Result 2352 states and 3018 transitions. [2018-01-29 23:06:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:06:23,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-29 23:06:23,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:23,520 INFO L225 Difference]: With dead ends: 2352 [2018-01-29 23:06:23,520 INFO L226 Difference]: Without dead ends: 1531 [2018-01-29 23:06:23,524 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:06:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-01-29 23:06:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1486. [2018-01-29 23:06:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-01-29 23:06:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1854 transitions. [2018-01-29 23:06:23,594 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1854 transitions. Word has length 34 [2018-01-29 23:06:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:23,594 INFO L432 AbstractCegarLoop]: Abstraction has 1486 states and 1854 transitions. [2018-01-29 23:06:23,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:06:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1854 transitions. [2018-01-29 23:06:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 23:06:23,596 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:23,596 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:23,597 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash 256921732, now seen corresponding path program 1 times [2018-01-29 23:06:23,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:23,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:23,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:23,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:23,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:23,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:23,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:23,703 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:06:23,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:23,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:23,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:23,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-29 23:06:23,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:06:23,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:06:23,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:06:23,912 INFO L87 Difference]: Start difference. First operand 1486 states and 1854 transitions. Second operand 8 states. [2018-01-29 23:06:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:24,362 INFO L93 Difference]: Finished difference Result 3748 states and 4702 transitions. [2018-01-29 23:06:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:06:24,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-01-29 23:06:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:24,371 INFO L225 Difference]: With dead ends: 3748 [2018-01-29 23:06:24,371 INFO L226 Difference]: Without dead ends: 2277 [2018-01-29 23:06:24,375 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:06:24,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2018-01-29 23:06:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2160. [2018-01-29 23:06:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2018-01-29 23:06:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 2684 transitions. [2018-01-29 23:06:24,452 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 2684 transitions. Word has length 51 [2018-01-29 23:06:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:24,453 INFO L432 AbstractCegarLoop]: Abstraction has 2160 states and 2684 transitions. [2018-01-29 23:06:24,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:06:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2684 transitions. [2018-01-29 23:06:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 23:06:24,454 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:24,454 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:24,454 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:24,454 INFO L82 PathProgramCache]: Analyzing trace with hash 530643588, now seen corresponding path program 1 times [2018-01-29 23:06:24,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:24,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:24,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:24,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:24,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:24,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:24,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:24,576 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:06:24,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:24,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:06:24,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:24,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-29 23:06:24,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:06:24,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:06:24,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:06:24,824 INFO L87 Difference]: Start difference. First operand 2160 states and 2684 transitions. Second operand 7 states. [2018-01-29 23:06:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:25,743 INFO L93 Difference]: Finished difference Result 9067 states and 11544 transitions. [2018-01-29 23:06:25,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:06:25,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-01-29 23:06:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:25,782 INFO L225 Difference]: With dead ends: 9067 [2018-01-29 23:06:25,782 INFO L226 Difference]: Without dead ends: 6922 [2018-01-29 23:06:25,789 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:06:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2018-01-29 23:06:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6534. [2018-01-29 23:06:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6534 states. [2018-01-29 23:06:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 8168 transitions. [2018-01-29 23:06:26,119 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 8168 transitions. Word has length 52 [2018-01-29 23:06:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:26,120 INFO L432 AbstractCegarLoop]: Abstraction has 6534 states and 8168 transitions. [2018-01-29 23:06:26,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:06:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 8168 transitions. [2018-01-29 23:06:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:06:26,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:26,123 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:26,123 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1104954809, now seen corresponding path program 1 times [2018-01-29 23:06:26,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:26,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:26,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:26,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:26,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-29 23:06:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-29 23:06:26,215 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-29 23:06:26,314 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-29 23:06:26,343 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-29 23:06:26,344 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-29 23:06:26,346 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-29 23:06:26,347 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-29 23:06:26,347 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-29 23:06:26,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:06:26 BoogieIcfgContainer [2018-01-29 23:06:26,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:06:26,379 INFO L168 Benchmark]: Toolchain (without parser) took 6220.32 ms. Allocated memory was 302.5 MB in the beginning and 519.0 MB in the end (delta: 216.5 MB). Free memory was 261.4 MB in the beginning and 397.1 MB in the end (delta: -135.7 MB). Peak memory consumption was 80.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:26,380 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:06:26,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.36 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 249.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:26,381 INFO L168 Benchmark]: Boogie Preprocessor took 38.18 ms. Allocated memory is still 302.5 MB. Free memory was 249.3 MB in the beginning and 247.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:26,382 INFO L168 Benchmark]: RCFGBuilder took 458.16 ms. Allocated memory is still 302.5 MB. Free memory was 247.3 MB in the beginning and 216.3 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:26,382 INFO L168 Benchmark]: TraceAbstraction took 5474.05 ms. Allocated memory was 302.5 MB in the beginning and 519.0 MB in the end (delta: 216.5 MB). Free memory was 216.3 MB in the beginning and 397.1 MB in the end (delta: -180.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:26,384 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.36 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 249.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.18 ms. Allocated memory is still 302.5 MB. Free memory was 249.3 MB in the beginning and 247.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 458.16 ms. Allocated memory is still 302.5 MB. Free memory was 247.3 MB in the beginning and 216.3 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5474.05 ms. Allocated memory was 302.5 MB in the beginning and 519.0 MB in the end (delta: 216.5 MB). Free memory was 216.3 MB in the beginning and 397.1 MB in the end (delta: -180.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: IVAL [\old(garbage)=29, \old(garbage)=27, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=18, \old(S)=11, \old(t1)=17, \old(t1)=22, \old(t4)=28, \old(t4)=12, \old(x1)=9, \old(x1)=26, \old(x4)=15, \old(x4)=23, garbage={27:29}, pc1=16, pc4=20, res4=14, S={18:11}, t1={22:17}, t4={28:12}, x1={9:26}, x4={15:23}] [L625] int pc1 = 1; VAL [\old(garbage)=29, \old(garbage)=27, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=18, \old(S)=11, \old(t1)=17, \old(t1)=22, \old(t4)=28, \old(t4)=12, \old(x1)=26, \old(x1)=9, \old(x4)=23, \old(x4)=15, garbage={27:29}, pc1=1, pc4=20, res4=14, S={18:11}, t1={22:17}, t4={28:12}, x1={9:26}, x4={15:23}] [L626] int pc4 = 1; VAL [\old(garbage)=29, \old(garbage)=27, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=18, \old(S)=11, \old(t1)=22, \old(t1)=17, \old(t4)=12, \old(t4)=28, \old(x1)=9, \old(x1)=26, \old(x4)=15, \old(x4)=23, garbage={27:29}, pc1=1, pc4=1, res4=14, S={18:11}, t1={22:17}, t4={28:12}, x1={9:26}, x4={15:23}] [L624] struct cell *S; VAL [\old(garbage)=27, \old(garbage)=29, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=11, \old(S)=18, \old(t1)=22, \old(t1)=17, \old(t4)=12, \old(t4)=28, \old(x1)=26, \old(x1)=9, \old(x4)=15, \old(x4)=23, garbage={27:29}, pc1=1, pc4=1, res4=14, S={0:0}, t1={22:17}, t4={28:12}, x1={9:26}, x4={15:23}] [L627] static struct cell *t1 = ((void *)0); VAL [\old(garbage)=27, \old(garbage)=29, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=11, \old(S)=18, \old(t1)=22, \old(t1)=17, \old(t4)=28, \old(t4)=12, \old(x1)=26, \old(x1)=9, \old(x4)=15, \old(x4)=23, garbage={27:29}, pc1=1, pc4=1, res4=14, S={0:0}, t1={0:0}, t4={28:12}, x1={9:26}, x4={15:23}] [L628] static struct cell *x1 = ((void *)0); VAL [\old(garbage)=29, \old(garbage)=27, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=18, \old(S)=11, \old(t1)=17, \old(t1)=22, \old(t4)=28, \old(t4)=12, \old(x1)=26, \old(x1)=9, \old(x4)=23, \old(x4)=15, garbage={27:29}, pc1=1, pc4=1, res4=14, S={0:0}, t1={0:0}, t4={28:12}, x1={0:0}, x4={15:23}] [L657] struct cell* garbage; VAL [\old(garbage)=27, \old(garbage)=29, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=18, \old(S)=11, \old(t1)=17, \old(t1)=22, \old(t4)=28, \old(t4)=12, \old(x1)=26, \old(x1)=9, \old(x4)=15, \old(x4)=23, garbage={0:0}, pc1=1, pc4=1, res4=14, S={0:0}, t1={0:0}, t4={28:12}, x1={0:0}, x4={15:23}] [L658] static struct cell *t4 = ((void *)0); VAL [\old(garbage)=27, \old(garbage)=29, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=18, \old(S)=11, \old(t1)=17, \old(t1)=22, \old(t4)=28, \old(t4)=12, \old(x1)=26, \old(x1)=9, \old(x4)=23, \old(x4)=15, garbage={0:0}, pc1=1, pc4=1, res4=14, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={15:23}] [L659] static struct cell *x4 = ((void *)0); VAL [\old(garbage)=27, \old(garbage)=29, \old(pc1)=16, \old(pc4)=20, \old(res4)=14, \old(S)=18, \old(S)=11, \old(t1)=17, \old(t1)=22, \old(t4)=28, \old(t4)=12, \old(x1)=9, \old(x1)=26, \old(x4)=15, \old(x4)=23, garbage={0:0}, pc1=1, pc4=1, res4=14, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={21:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={21:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={21:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={21:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L701] S = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L702] t1 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={21:0}, x4={0:0}] [L703] x1 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L704] t4 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L705] x4 = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 19 error locations. UNSAFE Result, 5.4s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1529 SDtfs, 1204 SDslu, 2581 SDs, 0 SdLazy, 453 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 121 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6534occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 683 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 41695 SizeOfPredicates, 13 NumberOfNonLiveVariables, 620 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 26/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-06-26-393.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-06-26-393.csv Received shutdown request...