/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/packet_filter.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:30:10,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:30:10,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:30:10,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:30:10,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:30:10,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:30:10,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:30:10,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:30:10,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:30:10,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:30:10,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:30:10,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:30:10,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:30:10,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:30:10,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:30:10,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:30:10,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:30:10,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:30:10,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:30:10,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:30:10,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:30:10,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:30:10,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:30:10,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:30:10,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:30:10,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:30:10,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:30:10,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:30:10,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:30:10,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:30:10,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:30:10,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:30:10,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:30:10,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:30:10,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:30:10,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:30:10,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:30:10,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:30:10,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:30:10,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:30:10,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:30:10,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:30:11,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:30:11,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:30:11,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:30:11,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:30:11,008 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:30:11,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:30:11,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:30:11,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:30:11,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:30:11,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:30:11,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:30:11,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:30:11,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:30:11,013 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:30:11,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:30:11,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:30:11,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:30:11,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:30:11,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:30:11,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:30:11,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:30:11,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:30:11,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:30:11,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:30:11,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:30:11,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:30:11,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:30:11,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:30:11,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:30:11,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:30:11,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:30:11,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:30:11,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:30:11,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:30:11,307 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:30:11,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/packet_filter.i [2019-11-23 21:30:11,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df1b1e92/3f90b541ed5c446899369d33dde4dd2e/FLAG9c42c7ade [2019-11-23 21:30:11,871 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:30:11,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/packet_filter.i [2019-11-23 21:30:11,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df1b1e92/3f90b541ed5c446899369d33dde4dd2e/FLAG9c42c7ade [2019-11-23 21:30:12,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df1b1e92/3f90b541ed5c446899369d33dde4dd2e [2019-11-23 21:30:12,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:30:12,220 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:30:12,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:30:12,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:30:12,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:30:12,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27090b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12, skipping insertion in model container [2019-11-23 21:30:12,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:30:12,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:30:12,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:12,760 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:30:12,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:12,885 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:30:12,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12 WrapperNode [2019-11-23 21:30:12,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:30:12,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:12,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:30:12,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:30:12,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:12,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:30:12,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:30:12,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:30:12,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:12,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:13,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:13,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... [2019-11-23 21:30:13,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:30:13,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:30:13,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:30:13,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:30:13,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:30:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:30:13,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:30:13,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:30:13,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:30:13,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 21:30:13,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:30:13,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2019-11-23 21:30:13,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:30:13,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-23 21:30:13,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-23 21:30:13,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:30:13,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:30:13,820 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:30:13,821 INFO L284 CfgBuilder]: Removed 23 assume(true) statements. [2019-11-23 21:30:13,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:13 BoogieIcfgContainer [2019-11-23 21:30:13,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:30:13,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:30:13,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:30:13,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:30:13,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:30:12" (1/3) ... [2019-11-23 21:30:13,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea1f5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:13, skipping insertion in model container [2019-11-23 21:30:13,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:12" (2/3) ... [2019-11-23 21:30:13,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea1f5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:13, skipping insertion in model container [2019-11-23 21:30:13,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:13" (3/3) ... [2019-11-23 21:30:13,831 INFO L109 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2019-11-23 21:30:13,841 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:30:13,849 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-23 21:30:13,860 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-23 21:30:13,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:30:13,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:30:13,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:30:13,884 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:30:13,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:30:13,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:30:13,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:30:13,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:30:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-23 21:30:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 21:30:13,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:13,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:13,907 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1360133385, now seen corresponding path program 1 times [2019-11-23 21:30:13,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:13,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606208369] [2019-11-23 21:30:13,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:14,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606208369] [2019-11-23 21:30:14,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:14,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:30:14,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009110448] [2019-11-23 21:30:14,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:30:14,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:30:14,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:30:14,103 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-23 21:30:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:14,122 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2019-11-23 21:30:14,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:30:14,124 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-23 21:30:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:14,135 INFO L225 Difference]: With dead ends: 58 [2019-11-23 21:30:14,136 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 21:30:14,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:30:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 21:30:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-23 21:30:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-23 21:30:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-11-23 21:30:14,176 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 8 [2019-11-23 21:30:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:14,176 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-11-23 21:30:14,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:30:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-11-23 21:30:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 21:30:14,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:14,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:14,195 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1245000239, now seen corresponding path program 1 times [2019-11-23 21:30:14,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:14,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835282715] [2019-11-23 21:30:14,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:14,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835282715] [2019-11-23 21:30:14,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:14,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:30:14,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789551303] [2019-11-23 21:30:14,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:30:14,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:30:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:30:14,348 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2019-11-23 21:30:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:14,573 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-11-23 21:30:14,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:30:14,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-23 21:30:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:14,575 INFO L225 Difference]: With dead ends: 60 [2019-11-23 21:30:14,575 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 21:30:14,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:30:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 21:30:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2019-11-23 21:30:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-23 21:30:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-11-23 21:30:14,592 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 9 [2019-11-23 21:30:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:14,592 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-23 21:30:14,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:30:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-11-23 21:30:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:30:14,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:14,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:14,597 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1888752216, now seen corresponding path program 1 times [2019-11-23 21:30:14,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:14,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94092791] [2019-11-23 21:30:14,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:14,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94092791] [2019-11-23 21:30:14,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:14,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:30:14,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712963682] [2019-11-23 21:30:14,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:30:14,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:14,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:30:14,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:30:14,716 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 4 states. [2019-11-23 21:30:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:14,890 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-23 21:30:14,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:30:14,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 21:30:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:14,894 INFO L225 Difference]: With dead ends: 46 [2019-11-23 21:30:14,894 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 21:30:14,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:30:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 21:30:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-23 21:30:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 21:30:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-23 21:30:14,904 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2019-11-23 21:30:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:14,905 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-23 21:30:14,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:30:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-23 21:30:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:30:14,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:14,908 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:14,908 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1449264443, now seen corresponding path program 1 times [2019-11-23 21:30:14,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:14,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375593213] [2019-11-23 21:30:14,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:30:15,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375593213] [2019-11-23 21:30:15,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:15,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:30:15,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6892494] [2019-11-23 21:30:15,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:30:15,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:30:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:30:15,026 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 3 states. [2019-11-23 21:30:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:15,043 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-11-23 21:30:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:30:15,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 21:30:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:15,047 INFO L225 Difference]: With dead ends: 37 [2019-11-23 21:30:15,047 INFO L226 Difference]: Without dead ends: 35 [2019-11-23 21:30:15,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:30:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-23 21:30:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-23 21:30:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 21:30:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-23 21:30:15,054 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 16 [2019-11-23 21:30:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:15,055 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-23 21:30:15,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:30:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-23 21:30:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:30:15,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:15,056 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:15,056 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1449262521, now seen corresponding path program 1 times [2019-11-23 21:30:15,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:15,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493532258] [2019-11-23 21:30:15,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:15,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493532258] [2019-11-23 21:30:15,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109716511] [2019-11-23 21:30:15,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:15,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 21:30:15,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:15,452 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-23 21:30:15,453 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-23 21:30:15,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,473 INFO L496 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. [2019-11-23 21:30:15,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2019-11-23 21:30:15,518 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2019-11-23 21:30:15,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2019-11-23 21:30:15,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2019-11-23 21:30:15,581 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,593 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:19 [2019-11-23 21:30:15,610 INFO L377 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 27 treesize of output 11 [2019-11-23 21:30:15,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,639 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:15,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,661 INFO L377 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 21 treesize of output 20 [2019-11-23 21:30:15,662 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:15,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 29 [2019-11-23 21:30:15,685 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,702 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:83, output treesize:15 [2019-11-23 21:30:15,722 INFO L377 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 15 treesize of output 7 [2019-11-23 21:30:15,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,738 INFO L377 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 15 treesize of output 7 [2019-11-23 21:30:15,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-23 21:30:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:15,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:15,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-23 21:30:15,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498358744] [2019-11-23 21:30:15,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:30:15,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:30:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:30:15,753 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 6 states. [2019-11-23 21:30:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:16,596 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-11-23 21:30:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:30:16,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 21:30:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:16,599 INFO L225 Difference]: With dead ends: 71 [2019-11-23 21:30:16,599 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 21:30:16,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:30:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 21:30:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-23 21:30:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 21:30:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-11-23 21:30:16,607 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 16 [2019-11-23 21:30:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:16,607 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-11-23 21:30:16,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:30:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2019-11-23 21:30:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:30:16,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:16,609 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:16,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:16,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1928933206, now seen corresponding path program 1 times [2019-11-23 21:30:16,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:16,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284738411] [2019-11-23 21:30:16,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:17,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284738411] [2019-11-23 21:30:17,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5085782] [2019-11-23 21:30:17,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:17,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-23 21:30:17,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:17,354 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_int_57|], 3=[|v_#memory_int_58|], 6=[|v_#memory_int_60|], 7=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_67|]} [2019-11-23 21:30:17,361 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:17,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,461 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:17,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,552 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:17,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,651 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 177 [2019-11-23 21:30:17,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,678 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_11], 5=[v_arrayElimCell_10]} [2019-11-23 21:30:17,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:17,894 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-23 21:30:17,902 INFO L168 Benchmark]: Toolchain (without parser) took 5683.62 ms. Allocated memory was 144.7 MB in the beginning and 249.6 MB in the end (delta: 104.9 MB). Free memory was 101.7 MB in the beginning and 143.7 MB in the end (delta: -42.1 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:17,903 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 21:30:17,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 665.63 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 166.8 MB in the end (delta: -65.6 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:17,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.94 ms. Allocated memory is still 202.9 MB. Free memory was 166.8 MB in the beginning and 164.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:17,905 INFO L168 Benchmark]: Boogie Preprocessor took 54.47 ms. Allocated memory is still 202.9 MB. Free memory was 164.0 MB in the beginning and 161.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:17,906 INFO L168 Benchmark]: RCFGBuilder took 809.49 ms. Allocated memory is still 202.9 MB. Free memory was 160.5 MB in the beginning and 107.8 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:17,906 INFO L168 Benchmark]: TraceAbstraction took 4077.29 ms. Allocated memory was 202.9 MB in the beginning and 249.6 MB in the end (delta: 46.7 MB). Free memory was 107.8 MB in the beginning and 143.7 MB in the end (delta: -36.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:17,911 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 665.63 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 166.8 MB in the end (delta: -65.6 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.94 ms. Allocated memory is still 202.9 MB. Free memory was 166.8 MB in the beginning and 164.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.47 ms. Allocated memory is still 202.9 MB. Free memory was 164.0 MB in the beginning and 161.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.49 ms. Allocated memory is still 202.9 MB. Free memory was 160.5 MB in the beginning and 107.8 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4077.29 ms. Allocated memory was 202.9 MB in the beginning and 249.6 MB in the end (delta: 46.7 MB). Free memory was 107.8 MB in the beginning and 143.7 MB in the end (delta: -36.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...