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_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 18:06:49,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 18:06:49,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 18:06:49,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 18:06:49,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 18:06:49,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 18:06:49,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 18:06:49,279 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 18:06:49,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 18:06:49,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 18:06:49,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 18:06:49,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 18:06:49,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 18:06:49,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 18:06:49,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 18:06:49,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 18:06:49,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 18:06:49,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 18:06:49,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 18:06:49,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 18:06:49,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 18:06:49,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 18:06:49,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 18:06:49,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 18:06:49,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 18:06:49,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 18:06:49,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 18:06:49,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 18:06:49,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 18:06:49,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 18:06:49,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 18:06:49,312 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-05 18:06:49,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 18:06:49,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 18:06:49,341 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 18:06:49,341 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 18:06:49,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 18:06:49,342 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 18:06:49,342 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 18:06:49,343 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 18:06:49,343 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 18:06:49,343 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 18:06:49,343 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 18:06:49,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 18:06:49,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 18:06:49,344 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 18:06:49,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 18:06:49,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 18:06:49,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 18:06:49,345 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 18:06:49,345 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 18:06:49,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 18:06:49,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 18:06:49,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 18:06:49,346 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 18:06:49,346 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 18:06:49,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 18:06:49,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 18:06:49,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 18:06:49,347 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 18:06:49,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 18:06:49,347 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 18:06:49,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 18:06:49,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:49,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 18:06:49,348 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 18:06:49,349 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 18:06:49,349 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 18:06:49,349 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 18:06:49,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 18:06:49,416 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 18:06:49,422 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 18:06:49,424 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 18:06:49,424 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 18:06:49,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-04-05 18:06:49,785 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ebae1b78 [2018-04-05 18:06:49,908 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 18:06:49,908 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 18:06:49,909 INFO L168 CDTParser]: Scanning test-bitfields-2_false-valid-deref.i [2018-04-05 18:06:49,911 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 18:06:49,911 INFO L215 ultiparseSymbolTable]: [2018-04-05 18:06:49,911 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 18:06:49,911 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_false-valid-deref.i [2018-04-05 18:06:49,911 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 18:06:49,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-2_false-valid-deref.i [2018-04-05 18:06:49,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-2_false-valid-deref.i [2018-04-05 18:06:49,928 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ebae1b78 [2018-04-05 18:06:49,933 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 18:06:49,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 18:06:49,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 18:06:49,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 18:06:49,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 18:06:49,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:06:49" (1/1) ... [2018-04-05 18:06:49,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28845f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:49, skipping insertion in model container [2018-04-05 18:06:49,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:06:49" (1/1) ... [2018-04-05 18:06:49,970 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:06:49,987 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:06:50,124 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:06:50,156 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:06:50,165 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-05 18:06:50,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50 WrapperNode [2018-04-05 18:06:50,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 18:06:50,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 18:06:50,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 18:06:50,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 18:06:50,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (1/1) ... [2018-04-05 18:06:50,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (1/1) ... [2018-04-05 18:06:50,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (1/1) ... [2018-04-05 18:06:50,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (1/1) ... [2018-04-05 18:06:50,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (1/1) ... [2018-04-05 18:06:50,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (1/1) ... [2018-04-05 18:06:50,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (1/1) ... [2018-04-05 18:06:50,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 18:06:50,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 18:06:50,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 18:06:50,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 18:06:50,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (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-04-05 18:06:50,307 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 18:06:50,307 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 18:06:50,307 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 18:06:50,307 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-05 18:06:50,307 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-05 18:06:50,308 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 18:06:50,308 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 18:06:50,308 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 18:06:50,308 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 18:06:50,308 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-05 18:06:50,308 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 18:06:50,309 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 18:06:50,309 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 18:06:50,309 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 18:06:50,309 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 18:06:50,309 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 18:06:50,804 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-05 18:06:50,865 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 18:06:50,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:06:50 BoogieIcfgContainer [2018-04-05 18:06:50,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 18:06:50,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 18:06:50,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 18:06:50,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 18:06:50,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:06:49" (1/3) ... [2018-04-05 18:06:50,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f54735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:06:50, skipping insertion in model container [2018-04-05 18:06:50,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:50" (2/3) ... [2018-04-05 18:06:50,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f54735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:06:50, skipping insertion in model container [2018-04-05 18:06:50,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:06:50" (3/3) ... [2018-04-05 18:06:50,872 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-04-05 18:06:50,880 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 18:06:50,886 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-05 18:06:50,931 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 18:06:50,932 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 18:06:50,932 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 18:06:50,932 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 18:06:50,932 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 18:06:50,932 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 18:06:50,933 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 18:06:50,935 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 18:06:50,935 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 18:06:50,936 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 18:06:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-04-05 18:06:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-05 18:06:50,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:06:50,960 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:06:50,961 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:06:50,964 INFO L82 PathProgramCache]: Analyzing trace with hash -506314848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:50,976 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:06:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:06:51,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:06:51,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:06:51,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:51,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:51,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:06:51,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 18:06:51,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:51,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 18:06:51,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-05 18:06:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:51,203 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:06:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:51,363 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:06:51,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 18:06:51,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 18:06:51,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 18:06:51,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 18:06:51,378 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-04-05 18:06:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:06:51,539 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-04-05 18:06:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 18:06:51,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-05 18:06:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:06:51,553 INFO L225 Difference]: With dead ends: 160 [2018-04-05 18:06:51,553 INFO L226 Difference]: Without dead ends: 151 [2018-04-05 18:06:51,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 18:06:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-05 18:06:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-04-05 18:06:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-05 18:06:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-04-05 18:06:51,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-04-05 18:06:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:06:51,613 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-04-05 18:06:51,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 18:06:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-04-05 18:06:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-05 18:06:51,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:06:51,614 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:06:51,614 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:06:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -506314847, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:51,626 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:06:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:06:51,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:06:51,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:06:51,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:51,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:51,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:06:51,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 18:06:51,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:51,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 18:06:51,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 18:06:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:51,779 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:06:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:52,218 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:06:52,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-05 18:06:52,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 18:06:52,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 18:06:52,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-05 18:06:52,220 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 5 states. [2018-04-05 18:06:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:06:52,384 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-04-05 18:06:52,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 18:06:52,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-05 18:06:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:06:52,386 INFO L225 Difference]: With dead ends: 102 [2018-04-05 18:06:52,390 INFO L226 Difference]: Without dead ends: 96 [2018-04-05 18:06:52,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-05 18:06:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-05 18:06:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-05 18:06:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-05 18:06:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-05 18:06:52,416 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-04-05 18:06:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:06:52,421 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-05 18:06:52,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 18:06:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-05 18:06:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 18:06:52,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:06:52,422 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:06:52,422 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:06:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash 51854364, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:52,436 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:06:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:06:52,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:06:52,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:06:52,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:52,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:52,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:06:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:52,591 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:06:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:52,722 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:06:52,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 18:06:52,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:06:52,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:06:52,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:06:52,723 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-04-05 18:06:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:06:52,914 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-04-05 18:06:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 18:06:52,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-05 18:06:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:06:52,915 INFO L225 Difference]: With dead ends: 96 [2018-04-05 18:06:52,915 INFO L226 Difference]: Without dead ends: 84 [2018-04-05 18:06:52,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 18:06:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-05 18:06:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-05 18:06:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-05 18:06:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-05 18:06:52,922 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2018-04-05 18:06:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:06:52,922 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-05 18:06:52,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:06:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-05 18:06:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 18:06:52,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:06:52,923 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:06:52,923 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:06:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash 51854362, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:52,930 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:06:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:06:52,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:06:52,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:06:52,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:52,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:52,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:06:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:52,984 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:06:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:53,011 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:06:53,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 18:06:53,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 18:06:53,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 18:06:53,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 18:06:53,012 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 4 states. [2018-04-05 18:06:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:06:53,183 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-04-05 18:06:53,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 18:06:53,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-05 18:06:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:06:53,184 INFO L225 Difference]: With dead ends: 126 [2018-04-05 18:06:53,185 INFO L226 Difference]: Without dead ends: 114 [2018-04-05 18:06:53,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-04-05 18:06:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-05 18:06:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2018-04-05 18:06:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-05 18:06:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-05 18:06:53,192 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-05 18:06:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:06:53,192 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-05 18:06:53,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 18:06:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-05 18:06:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-05 18:06:53,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:06:53,194 INFO L355 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, 1, 1, 1] [2018-04-05 18:06:53,194 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:06:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2075956322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:53,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:06:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:06:53,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:06:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:53,379 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:06:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:53,505 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:06:53,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-05 18:06:53,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:06:53,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:06:53,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:06:53,506 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-04-05 18:06:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:06:53,553 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-04-05 18:06:53,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 18:06:53,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-04-05 18:06:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:06:53,556 INFO L225 Difference]: With dead ends: 143 [2018-04-05 18:06:53,556 INFO L226 Difference]: Without dead ends: 87 [2018-04-05 18:06:53,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-05 18:06:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-05 18:06:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-05 18:06:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-05 18:06:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-05 18:06:53,567 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 37 [2018-04-05 18:06:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:06:53,568 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-05 18:06:53,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:06:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-05 18:06:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-05 18:06:53,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:06:53,570 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-05 18:06:53,570 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:06:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1900445346, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:53,586 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:06:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:06:53,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:06:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:53,669 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:06:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:53,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:06:53,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-05 18:06:53,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 18:06:53,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 18:06:53,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-05 18:06:53,782 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-04-05 18:06:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:06:53,959 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-04-05 18:06:53,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-05 18:06:53,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-05 18:06:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:06:53,961 INFO L225 Difference]: With dead ends: 152 [2018-04-05 18:06:53,962 INFO L226 Difference]: Without dead ends: 96 [2018-04-05 18:06:53,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-05 18:06:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-05 18:06:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-05 18:06:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-05 18:06:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-05 18:06:53,970 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2018-04-05 18:06:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:06:53,970 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-05 18:06:53,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 18:06:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-05 18:06:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-05 18:06:53,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:06:53,972 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 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-04-05 18:06:53,972 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:06:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1778096232, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:06:53,981 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:06:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:06:54,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:06:54,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-05 18:06:54,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-05 18:06:54,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-05 18:06:54,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-05 18:06:54,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-05 18:06:54,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-05 18:06:54,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-05 18:06:54,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-04-05 18:06:54,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-05 18:06:54,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-05 18:06:54,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-04-05 18:06:54,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-05 18:06:54,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-05 18:06:54,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-04-05 18:06:54,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-05 18:06:54,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-04-05 18:06:54,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:54,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-04-05 18:06:54,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:54,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-05 18:06:55,722 WARN L151 SmtUtils]: Spent 645ms on a formula simplification. DAG size of input: 161 DAG size of output 40 [2018-04-05 18:06:55,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 81 [2018-04-05 18:06:55,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-04-05 18:06:55,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2018-04-05 18:06:55,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2018-04-05 18:06:55,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 165 [2018-04-05 18:06:55,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:55,976 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-04-05 18:06:55,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 214 [2018-04-05 18:06:55,978 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,050 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 18:06:56,198 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:375, output treesize:108 [2018-04-05 18:06:56,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 82 [2018-04-05 18:06:56,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:06:56,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,422 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:06:56,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,424 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:06:56,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,425 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:06:56,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:06:56,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:06:56,458 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-04-05 18:06:56,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 175 [2018-04-05 18:06:56,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 18:06:56,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:06:56,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:7 [2018-04-05 18:06:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:06:56,597 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:06:56,792 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-05 18:06:58,145 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 99 DAG size of output 85 [2018-04-05 18:06:58,839 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-04-05 18:07:00,556 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-04-05 18:07:01,086 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 18:07:01,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:01,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:01,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:552, output treesize:1 [2018-04-05 18:07:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:07:01,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:07:01,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 40 [2018-04-05 18:07:01,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-05 18:07:01,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-05 18:07:01,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1305, Unknown=10, NotChecked=0, Total=1560 [2018-04-05 18:07:01,167 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 40 states. [2018-04-05 18:07:05,993 WARN L151 SmtUtils]: Spent 2550ms on a formula simplification. DAG size of input: 200 DAG size of output 146 [2018-04-05 18:07:07,401 WARN L151 SmtUtils]: Spent 723ms on a formula simplification. DAG size of input: 144 DAG size of output 120 [2018-04-05 18:07:10,603 WARN L151 SmtUtils]: Spent 1988ms on a formula simplification. DAG size of input: 180 DAG size of output 151 [2018-04-05 18:07:12,440 WARN L151 SmtUtils]: Spent 955ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-04-05 18:07:14,843 WARN L151 SmtUtils]: Spent 1248ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-04-05 18:07:16,014 WARN L148 SmtUtils]: Spent 450ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-05 18:07:17,636 WARN L151 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-04-05 18:07:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:07:19,636 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-04-05 18:07:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-05 18:07:19,637 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-04-05 18:07:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:07:19,641 INFO L225 Difference]: With dead ends: 313 [2018-04-05 18:07:19,641 INFO L226 Difference]: Without dead ends: 266 [2018-04-05 18:07:19,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=735, Invalid=4367, Unknown=10, NotChecked=0, Total=5112 [2018-04-05 18:07:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-05 18:07:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 116. [2018-04-05 18:07:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-05 18:07:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-04-05 18:07:19,660 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 52 [2018-04-05 18:07:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:07:19,660 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-04-05 18:07:19,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-05 18:07:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-04-05 18:07:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-05 18:07:19,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:07:19,662 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 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-04-05 18:07:19,662 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-05 18:07:19,662 INFO L82 PathProgramCache]: Analyzing trace with hash -248522691, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:07:19,670 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:07:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:07:19,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:07:19,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:07:19,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:07:19,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 18:07:19,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-05 18:07:19,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-05 18:07:19,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-05 18:07:19,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-05 18:07:19,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-05 18:07:19,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-04-05 18:07:19,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-05 18:07:19,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-05 18:07:19,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-04-05 18:07:19,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-05 18:07:19,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-04-05 18:07:19,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-04-05 18:07:19,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-05 18:07:19,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-04-05 18:07:19,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:19,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-05 18:07:19,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:19,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-05 18:07:20,716 WARN L151 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 176 DAG size of output 57 [2018-04-05 18:07:20,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2018-04-05 18:07:20,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-05 18:07:20,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-04-05 18:07:20,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 97 [2018-04-05 18:07:20,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 149 [2018-04-05 18:07:20,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:20,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 240 [2018-04-05 18:07:20,813 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:20,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:20,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:20,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:20,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:20,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:21,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-05 18:07:21,005 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:419, output treesize:130 [2018-04-05 18:07:21,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2018-04-05 18:07:21,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,174 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:21,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,217 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:21,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:21,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,290 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:21,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,365 INFO L303 Elim1Store]: Index analysis took 219 ms [2018-04-05 18:07:21,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 249 [2018-04-05 18:07:21,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:21,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,433 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:21,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:21,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 87 [2018-04-05 18:07:21,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:21,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:21,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:21,461 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:139, output treesize:3 [2018-04-05 18:07:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:07:21,524 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:07:21,720 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 69 [2018-04-05 18:08:21,840 WARN L148 SmtUtils]: Spent 879ms on a formula simplification that was a NOOP. DAG size: 85 [2018-04-05 18:08:59,169 WARN L148 SmtUtils]: Spent 2091ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-05 18:09:27,033 WARN L148 SmtUtils]: Spent 447ms on a formula simplification that was a NOOP. DAG size: 97 [2018-04-05 18:10:34,763 WARN L148 SmtUtils]: Spent 2165ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-05 18:10:36,778 WARN L1033 $PredicateComparison]: unable to prove that (or (< |c_#Ultimate.C_memcpy_dest.offset| 0) (< |c_#Ultimate.C_memcpy_src.offset| 0) (forall ((v_main_~p~0.offset_BEFORE_CALL_4 Int)) (or (< v_main_~p~0.offset_BEFORE_CALL_4 |c_#Ultimate.C_memcpy_dest.offset|) (= (mod (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)))) (store .cse3 (+ |c_#Ultimate.C_memcpy_dest.offset| 1) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse3) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 1)))))) (store .cse2 (+ |c_#Ultimate.C_memcpy_dest.offset| 2) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse2) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 2)))))) (store .cse1 (+ |c_#Ultimate.C_memcpy_dest.offset| 3) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse1) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 3)))))) (store .cse0 (+ |c_#Ultimate.C_memcpy_dest.offset| 4) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse0) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 4)))) (+ v_main_~p~0.offset_BEFORE_CALL_4 1)) 256) 2) (exists ((|v_#Ultimate.C_memcpy_dest.offset_13| Int) (|v_#Ultimate.C_memcpy_src.offset_12| Int)) (and (not (= (mod (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |v_#Ultimate.C_memcpy_dest.offset_13| (select (select |c_old(#memory_int)| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) |v_#Ultimate.C_memcpy_src.offset_12|)))) (store .cse7 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 1) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse7) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 1)))))) (store .cse6 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 2) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse6) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 2)))))) (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 3) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse5) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 3)))))) (store .cse4 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 4) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse4) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 4)))) (+ v_main_~p~0.offset_BEFORE_CALL_4 1)) 256) 2)) (<= 0 |v_#Ultimate.C_memcpy_dest.offset_13|) (<= |v_#Ultimate.C_memcpy_src.offset_12| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (<= 0 |v_#Ultimate.C_memcpy_src.offset_12|) (<= |v_#Ultimate.C_memcpy_dest.offset_13| v_main_~p~0.offset_BEFORE_CALL_4))))) (< |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| |c_#Ultimate.C_memcpy_src.offset|) (not (= |c_#Ultimate.C_memcpy_src.base| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|))) is different from true [2018-04-05 18:10:38,824 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_#Ultimate.C_memcpy_dest.offset_13| Int) (|v_#Ultimate.C_memcpy_src.offset_12| Int)) (or (< |v_#Ultimate.C_memcpy_src.offset_12| 0) (< |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| |v_#Ultimate.C_memcpy_src.offset_12|) (= (mod (select (let ((.cse5 (store (select |c_#memory_int| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 4) 5))) (let ((.cse1 (store |c_#memory_int| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| .cse5))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (select .cse1 c_main_~p~0.base) |v_#Ultimate.C_memcpy_dest.offset_13| (select .cse5 |v_#Ultimate.C_memcpy_src.offset_12|)))) (store .cse4 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 1) (select (select (store .cse1 c_main_~p~0.base .cse4) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 1)))))) (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 2) (select (select (store .cse1 c_main_~p~0.base .cse3) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 2)))))) (store .cse2 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 3) (select (select (store .cse1 c_main_~p~0.base .cse2) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 3)))))) (store .cse0 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 4) (select (select (store .cse1 c_main_~p~0.base .cse0) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 4)))))) (+ c_main_~p~0.offset 1)) 256) 2) (< c_main_~p~0.offset |v_#Ultimate.C_memcpy_dest.offset_13|) (< |v_#Ultimate.C_memcpy_dest.offset_13| 0))) is different from false Received shutdown request... [2018-04-05 18:11:35,170 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-05 18:11:35,170 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 18:11:35,176 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 18:11:35,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:11:35 BoogieIcfgContainer [2018-04-05 18:11:35,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 18:11:35,177 INFO L168 Benchmark]: Toolchain (without parser) took 285243.05 ms. Allocated memory was 305.1 MB in the beginning and 578.8 MB in the end (delta: 273.7 MB). Free memory was 246.6 MB in the beginning and 365.1 MB in the end (delta: -118.4 MB). Peak memory consumption was 155.2 MB. Max. memory is 5.3 GB. [2018-04-05 18:11:35,178 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.1 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 18:11:35,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.27 ms. Allocated memory is still 305.1 MB. Free memory was 246.6 MB in the beginning and 235.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-04-05 18:11:35,179 INFO L168 Benchmark]: Boogie Preprocessor took 52.51 ms. Allocated memory is still 305.1 MB. Free memory was 235.5 MB in the beginning and 234.5 MB in the end (delta: 997.2 kB). Peak memory consumption was 997.2 kB. Max. memory is 5.3 GB. [2018-04-05 18:11:35,180 INFO L168 Benchmark]: RCFGBuilder took 632.10 ms. Allocated memory was 305.1 MB in the beginning and 472.9 MB in the end (delta: 167.8 MB). Free memory was 233.6 MB in the beginning and 430.2 MB in the end (delta: -196.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-05 18:11:35,180 INFO L168 Benchmark]: TraceAbstraction took 284310.17 ms. Allocated memory was 472.9 MB in the beginning and 578.8 MB in the end (delta: 105.9 MB). Free memory was 430.2 MB in the beginning and 365.1 MB in the end (delta: 65.1 MB). Peak memory consumption was 171.0 MB. Max. memory is 5.3 GB. [2018-04-05 18:11:35,182 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.18 ms. Allocated memory is still 305.1 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.27 ms. Allocated memory is still 305.1 MB. Free memory was 246.6 MB in the beginning and 235.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.51 ms. Allocated memory is still 305.1 MB. Free memory was 235.5 MB in the beginning and 234.5 MB in the end (delta: 997.2 kB). Peak memory consumption was 997.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 632.10 ms. Allocated memory was 305.1 MB in the beginning and 472.9 MB in the end (delta: 167.8 MB). Free memory was 233.6 MB in the beginning and 430.2 MB in the end (delta: -196.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284310.17 ms. Allocated memory was 472.9 MB in the beginning and 578.8 MB in the end (delta: 105.9 MB). Free memory was 430.2 MB in the beginning and 365.1 MB in the end (delta: 65.1 MB). Peak memory consumption was 171.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 284.2s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 1931 SDslu, 1358 SDs, 0 SdLazy, 1286 SolverSat, 368 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 335 SyntacticMatches, 10 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=7, 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 230 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 44 QuantifiedInterpolants, 986432 SizeOfPredicates, 21 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-05_18-11-35-193.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_18-11-35-193.csv Completed graceful shutdown