./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s32iff.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s32iff.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea442e41085b839a6b68d90c75fddfd66bb794c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 14:55:27,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:55:27,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:55:27,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:55:27,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:55:27,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:55:27,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:55:27,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:55:27,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:55:27,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:55:27,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:55:27,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:55:27,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:55:27,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:55:27,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:55:27,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:55:27,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:55:27,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:55:27,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:55:27,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:55:27,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:55:27,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:55:27,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:55:27,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:55:27,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:55:27,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:55:27,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:55:27,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:55:27,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:55:27,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:55:27,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:55:27,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:55:27,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:55:27,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:55:27,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:55:27,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:55:27,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:55:27,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:55:27,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:55:27,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:55:27,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:55:27,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:55:27,929 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:55:27,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:55:27,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:55:27,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:55:27,932 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:55:27,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:55:27,932 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:55:27,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:55:27,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:55:27,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:55:27,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:55:27,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:55:27,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:55:27,934 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:55:27,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:55:27,935 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:55:27,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:55:27,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:55:27,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:55:27,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:55:27,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:55:27,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:55:27,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:55:27,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:55:27,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:55:27,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:55:27,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:55:27,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:55:27,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:55:27,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea442e41085b839a6b68d90c75fddfd66bb794c3 [2020-07-28 14:55:28,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:55:28,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:55:28,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:55:28,280 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:55:28,280 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:55:28,281 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s32iff.c [2020-07-28 14:55:28,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6ca7493/e9a2d3fc8cf348fc91ace5730a009c11/FLAGff8cacad2 [2020-07-28 14:55:28,804 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:55:28,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s32iff.c [2020-07-28 14:55:28,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6ca7493/e9a2d3fc8cf348fc91ace5730a009c11/FLAGff8cacad2 [2020-07-28 14:55:29,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6ca7493/e9a2d3fc8cf348fc91ace5730a009c11 [2020-07-28 14:55:29,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:55:29,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:55:29,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:55:29,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:55:29,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:55:29,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496c238a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29, skipping insertion in model container [2020-07-28 14:55:29,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:55:29,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:55:29,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:55:29,410 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:55:29,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:55:29,457 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:55:29,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29 WrapperNode [2020-07-28 14:55:29,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:55:29,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:55:29,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:55:29,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:55:29,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:55:29,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:55:29,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:55:29,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:55:29,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (1/1) ... [2020-07-28 14:55:29,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:55:29,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:55:29,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:55:29,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:55:29,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (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 [2020-07-28 14:55:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:55:29,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:55:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:55:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:55:29,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:55:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:55:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:55:30,136 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:55:30,136 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 14:55:30,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:55:30 BoogieIcfgContainer [2020-07-28 14:55:30,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:55:30,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:55:30,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:55:30,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:55:30,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:55:29" (1/3) ... [2020-07-28 14:55:30,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e155232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:55:30, skipping insertion in model container [2020-07-28 14:55:30,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:55:29" (2/3) ... [2020-07-28 14:55:30,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e155232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:55:30, skipping insertion in model container [2020-07-28 14:55:30,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:55:30" (3/3) ... [2020-07-28 14:55:30,149 INFO L109 eAbstractionObserver]: Analyzing ICFG s32iff.c [2020-07-28 14:55:30,160 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:55:30,168 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:55:30,180 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:55:30,200 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:55:30,201 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:55:30,201 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:55:30,201 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:55:30,201 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:55:30,201 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:55:30,202 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:55:30,202 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:55:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-28 14:55:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 14:55:30,221 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:30,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:55:30,223 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2020-07-28 14:55:30,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:30,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706595601] [2020-07-28 14:55:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:30,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {26#true} is VALID [2020-07-28 14:55:30,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~post3, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~post7, main_#t~mem13, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {26#true} is VALID [2020-07-28 14:55:30,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {26#true} is VALID [2020-07-28 14:55:30,401 INFO L280 TraceCheckUtils]: 3: Hoare triple {26#true} assume 0 == assume_abort_if_not_~cond;assume false; {27#false} is VALID [2020-07-28 14:55:30,402 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#false} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {27#false} is VALID [2020-07-28 14:55:30,403 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#false} assume !(main_~i~0 < ~N~0); {27#false} is VALID [2020-07-28 14:55:30,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#false} main_~i~0 := 0; {27#false} is VALID [2020-07-28 14:55:30,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#false} assume !(main_~i~0 < ~N~0); {27#false} is VALID [2020-07-28 14:55:30,404 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#false} main_~i~0 := 0; {27#false} is VALID [2020-07-28 14:55:30,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} assume !true; {27#false} is VALID [2020-07-28 14:55:30,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} call main_#t~mem13 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == 4 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27#false} is VALID [2020-07-28 14:55:30,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond; {27#false} is VALID [2020-07-28 14:55:30,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-28 14:55:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:55:30,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706595601] [2020-07-28 14:55:30,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:55:30,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:55:30,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351909292] [2020-07-28 14:55:30,424 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 14:55:30,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:55:30,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:55:30,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:55:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:55:30,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:55:30,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:55:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:55:30,501 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-28 14:55:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:30,596 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2020-07-28 14:55:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:55:30,597 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 14:55:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:55:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:55:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2020-07-28 14:55:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:55:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2020-07-28 14:55:30,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2020-07-28 14:55:30,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:55:30,800 INFO L225 Difference]: With dead ends: 42 [2020-07-28 14:55:30,800 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 14:55:30,806 INFO L675 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 [2020-07-28 14:55:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 14:55:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-28 14:55:30,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:55:30,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-28 14:55:30,846 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 14:55:30,846 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 14:55:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:30,849 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-07-28 14:55:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-07-28 14:55:30,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:30,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:30,850 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 14:55:30,850 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 14:55:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:30,853 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-07-28 14:55:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-07-28 14:55:30,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:30,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:30,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:55:30,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:55:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 14:55:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-07-28 14:55:30,858 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2020-07-28 14:55:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:55:30,859 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-07-28 14:55:30,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:55:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-07-28 14:55:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 14:55:30,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:30,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:55:30,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:55:30,861 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2020-07-28 14:55:30,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:30,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205724515] [2020-07-28 14:55:30,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:55:30,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {140#true} is VALID [2020-07-28 14:55:30,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~post3, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~post7, main_#t~mem13, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {140#true} is VALID [2020-07-28 14:55:30,963 INFO L280 TraceCheckUtils]: 2: Hoare triple {140#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {142#(<= 1 ~N~0)} is VALID [2020-07-28 14:55:30,964 INFO L280 TraceCheckUtils]: 3: Hoare triple {142#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {142#(<= 1 ~N~0)} is VALID [2020-07-28 14:55:30,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {142#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {143#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-28 14:55:30,968 INFO L280 TraceCheckUtils]: 5: Hoare triple {143#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {141#false} is VALID [2020-07-28 14:55:30,968 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#false} main_~i~0 := 0; {141#false} is VALID [2020-07-28 14:55:30,968 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#false} assume !(main_~i~0 < ~N~0); {141#false} is VALID [2020-07-28 14:55:30,969 INFO L280 TraceCheckUtils]: 8: Hoare triple {141#false} main_~i~0 := 0; {141#false} is VALID [2020-07-28 14:55:30,969 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#false} assume !(main_~i~0 < ~N~0); {141#false} is VALID [2020-07-28 14:55:30,969 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#false} call main_#t~mem13 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == 4 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {141#false} is VALID [2020-07-28 14:55:30,970 INFO L280 TraceCheckUtils]: 11: Hoare triple {141#false} assume 0 == __VERIFIER_assert_~cond; {141#false} is VALID [2020-07-28 14:55:30,970 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2020-07-28 14:55:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:55:30,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205724515] [2020-07-28 14:55:30,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:55:30,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:55:30,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072211056] [2020-07-28 14:55:30,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-28 14:55:30,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:55:30,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:55:30,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:55:30,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:55:30,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:55:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:55:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:55:30,996 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2020-07-28 14:55:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:31,177 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-07-28 14:55:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:55:31,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-28 14:55:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:55:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:55:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 14:55:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:55:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 14:55:31,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2020-07-28 14:55:31,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:55:31,273 INFO L225 Difference]: With dead ends: 39 [2020-07-28 14:55:31,273 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 14:55:31,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:55:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 14:55:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-07-28 14:55:31,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:55:31,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 22 states. [2020-07-28 14:55:31,289 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 22 states. [2020-07-28 14:55:31,289 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 22 states. [2020-07-28 14:55:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:31,292 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-28 14:55:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-28 14:55:31,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:31,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:31,293 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 27 states. [2020-07-28 14:55:31,293 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 27 states. [2020-07-28 14:55:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:55:31,296 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-28 14:55:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-28 14:55:31,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:55:31,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:55:31,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:55:31,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:55:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:55:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-28 14:55:31,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2020-07-28 14:55:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:55:31,300 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-28 14:55:31,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:55:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-28 14:55:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 14:55:31,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:55:31,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:55:31,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:55:31,302 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:55:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:55:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2020-07-28 14:55:31,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:55:31,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050965638] [2020-07-28 14:55:31,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:55:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:55:31,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:55:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:55:31,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:55:31,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:55:31,460 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:55:31,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 14:55:31,504 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:55:31,505 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:55:31,505 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:55:31,505 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:55:31,505 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 14:55:31,506 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:55:31,506 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:55:31,506 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:55:31,506 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:55:31,507 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:55:31,507 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:55:31,507 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 14:55:31,507 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-28 14:55:31,507 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 14:55:31,508 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:55:31,508 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:55:31,508 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 14:55:31,508 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-28 14:55:31,509 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:55:31,509 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 14:55:31,509 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:55:31,509 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:55:31,510 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-28 14:55:31,510 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 14:55:31,510 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-28 14:55:31,510 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 14:55:31,510 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 14:55:31,511 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:55:31,511 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:55:31,511 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-28 14:55:31,511 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:55:31,512 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:55:31,512 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:55:31,512 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 14:55:31,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:55:31 BoogieIcfgContainer [2020-07-28 14:55:31,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:55:31,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:55:31,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:55:31,516 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:55:31,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:55:30" (3/4) ... [2020-07-28 14:55:31,520 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:55:31,591 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:55:31,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:55:31,595 INFO L168 Benchmark]: Toolchain (without parser) took 2435.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 957.5 MB in the beginning and 1.0 GB in the end (delta: -51.4 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:31,596 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:55:31,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.32 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:31,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:31,598 INFO L168 Benchmark]: Boogie Preprocessor took 29.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:55:31,598 INFO L168 Benchmark]: RCFGBuilder took 525.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:31,599 INFO L168 Benchmark]: TraceAbstraction took 1373.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.4 MB). Peak memory consumption was 98.4 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:31,600 INFO L168 Benchmark]: Witness Printer took 76.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:55:31,606 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.32 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 525.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1373.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.4 MB). Peak memory consumption was 98.4 MB. Max. memory is 11.5 GB. * Witness Printer took 76.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L11] COND FALSE !(!cond) VAL [N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [N=1] [L30] COND TRUE i