java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 18:31:08,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 18:31:08,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 18:31:08,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 18:31:08,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 18:31:08,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 18:31:08,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 18:31:08,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 18:31:08,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 18:31:08,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 18:31:08,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 18:31:08,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 18:31:08,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 18:31:08,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 18:31:08,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 18:31:08,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 18:31:08,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 18:31:08,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 18:31:08,721 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 18:31:08,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 18:31:08,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 18:31:08,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 18:31:08,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 18:31:08,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 18:31:08,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 18:31:08,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 18:31:08,730 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 18:31:08,731 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 18:31:08,732 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 18:31:08,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 18:31:08,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 18:31:08,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 18:31:08,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 18:31:08,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 18:31:08,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 18:31:08,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 18:31:08,737 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-14 18:31:08,768 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 18:31:08,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 18:31:08,769 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 18:31:08,770 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 18:31:08,770 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 18:31:08,770 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 18:31:08,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 18:31:08,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 18:31:08,772 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 18:31:08,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 18:31:08,773 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 18:31:08,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 18:31:08,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 18:31:08,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 18:31:08,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 18:31:08,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 18:31:08,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 18:31:08,774 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 18:31:08,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 18:31:08,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 18:31:08,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 18:31:08,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 18:31:08,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 18:31:08,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 18:31:08,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 18:31:08,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 18:31:08,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 18:31:08,777 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-14 18:31:08,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 18:31:08,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 18:31:08,778 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 18:31:08,778 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 18:31:08,778 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 18:31:08,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 18:31:08,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 18:31:08,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 18:31:08,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 18:31:08,894 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 18:31:08,896 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-09-14 18:31:09,257 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0465690bc/e4fe234ebf8f471a82e41ed68a8802e0/FLAG73a5fe610 [2018-09-14 18:31:09,403 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 18:31:09,403 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-09-14 18:31:09,411 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0465690bc/e4fe234ebf8f471a82e41ed68a8802e0/FLAG73a5fe610 [2018-09-14 18:31:09,427 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0465690bc/e4fe234ebf8f471a82e41ed68a8802e0 [2018-09-14 18:31:09,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 18:31:09,441 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 18:31:09,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 18:31:09,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 18:31:09,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 18:31:09,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a2763a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09, skipping insertion in model container [2018-09-14 18:31:09,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,471 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 18:31:09,708 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 18:31:09,727 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 18:31:09,764 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 18:31:09,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09 WrapperNode [2018-09-14 18:31:09,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 18:31:09,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 18:31:09,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 18:31:09,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 18:31:09,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 18:31:09,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 18:31:09,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 18:31:09,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 18:31:09,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (1/1) ... [2018-09-14 18:31:09,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 18:31:09,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 18:31:09,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 18:31:09,847 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 18:31:09,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:31:09" (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 [2018-09-14 18:31:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 18:31:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 18:31:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 18:31:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 18:31:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 18:31:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 18:31:10,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-14 18:31:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-14 18:31:10,569 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 18:31:10,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 06:31:10 BoogieIcfgContainer [2018-09-14 18:31:10,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 18:31:10,570 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-09-14 18:31:10,571 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-09-14 18:31:10,571 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-09-14 18:31:10,572 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 06:31:10" (1/1) ... [2018-09-14 18:31:10,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-14 18:31:11,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-14 18:31:11,603 INFO L272 AbstractInterpreter]: Visited 52 different actions 529 times. Merged at 22 different actions 271 times. Widened at 6 different actions 42 times. Found 60 fixpoints after 11 different actions. Largest state had 19 variables. [2018-09-14 18:31:11,605 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-09-14 18:31:11,606 INFO L168 Benchmark]: Toolchain (without parser) took 2168.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -613.6 MB). Peak memory consumption was 147.6 MB. Max. memory is 7.1 GB. [2018-09-14 18:31:11,609 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 18:31:11,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-14 18:31:11,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 18:31:11,611 INFO L168 Benchmark]: Boogie Preprocessor took 31.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 18:31:11,612 INFO L168 Benchmark]: RCFGBuilder took 722.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-09-14 18:31:11,613 INFO L168 Benchmark]: Abstract Interpretation took 1035.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 160.6 MB). Peak memory consumption was 160.6 MB. Max. memory is 7.1 GB. [2018-09-14 18:31:11,619 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 342.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 722.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 1035.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 160.6 MB). Peak memory consumption was 160.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 5]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: abstract domain could reach this error location. Possible FailurePath: [L9] int INFINITY = 899; [L12] int nodecount = 5; [L13] int edgecount = 20; [L14] int source = 0; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L15] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L16] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L17] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L18] int distance[5]; [L19] int x,y; [L20] int i,j; [L22] i = 0 [L22] COND TRUE i < nodecount [L23] COND TRUE i == source [L24] distance[i] = 0 [L22] i++ [L22] i++ [L22] COND TRUE i < nodecount [L23] COND FALSE !(i == source) [L27] distance[i] = INFINITY [L22] i++ [L22] i++ [L22] COND TRUE i < nodecount [L23] COND FALSE !(i == source) [L27] distance[i] = INFINITY [L22] i++ [L22] i++ [L22] COND TRUE i < nodecount [L23] COND FALSE !(i == source) [L27] distance[i] = INFINITY [L22] i++ [L22] i++ [L22] COND TRUE i < nodecount [L23] COND FALSE !(i == source) [L27] distance[i] = INFINITY [L22] i++ [L22] i++ [L22] COND FALSE !(i < nodecount) [L31] i = 0 [L31] COND TRUE i < nodecount [L33] j = 0 [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND FALSE !(j < edgecount) [L31] i++ [L31] i++ [L31] COND TRUE i < nodecount [L33] j = 0 [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND FALSE !(j < edgecount) [L31] i++ [L31] i++ [L31] COND TRUE i < nodecount [L33] j = 0 [L33] COND FALSE !(j < edgecount) [L31] i++ [L31] i++ [L31] COND TRUE i < nodecount [L33] j = 0 [L33] COND TRUE j < edgecount [L35] x = Dest[j] [L36] y = Source[j] [L37] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L33] j++ [L33] j++ [L33] COND FALSE !(j < edgecount) [L31] i++ [L31] i++ [L31] COND TRUE i < nodecount [L33] j = 0 [L33] COND FALSE !(j < edgecount) [L31] i++ [L31] i++ [L31] COND FALSE !(i < nodecount) [L43] i = 0 [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND TRUE i < edgecount [L45] x = Dest[i] [L46] y = Source[i] [L47] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L43] i++ [L43] i++ [L43] COND FALSE !(i < edgecount) [L53] i = 0 [L53] COND TRUE i < nodecount [L55] CALL __VERIFIER_assert(distance[i]>=0) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_01_true-unreach-call.i_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AbstractInterpretationCInline.xml/Csv-Benchmark-0-2018-09-14_18-31-11-639.csv Received shutdown request...