/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/indp4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:09,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:09,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:09,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:09,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:09,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:09,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:09,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:09,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:09,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:09,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:09,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:09,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:09,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:09,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:09,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:09,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:09,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:09,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:09,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:09,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:09,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:09,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:09,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:09,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:09,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:09,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:09,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:09,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:09,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:09,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:09,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:09,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:09,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:09,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:09,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:09,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:09,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:09,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:09,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:09,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:09,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:09,979 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:09,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:09,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:09,981 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:09,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:09,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:09,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:09,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:09,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:09,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:09,983 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:09,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:09,983 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:09,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:09,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:09,984 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:09,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:09,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:09,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:09,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:09,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:09,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:09,985 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:10,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:10,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:10,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:10,407 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:10,408 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:10,409 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp4f.c [2020-07-10 20:21:10,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f6c0b53/10445be897cc4bde824a70c6e1add242/FLAG4dc0b82e9 [2020-07-10 20:21:11,021 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:11,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp4f.c [2020-07-10 20:21:11,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f6c0b53/10445be897cc4bde824a70c6e1add242/FLAG4dc0b82e9 [2020-07-10 20:21:11,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f6c0b53/10445be897cc4bde824a70c6e1add242 [2020-07-10 20:21:11,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:11,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:11,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:11,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:11,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:11,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d50a88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11, skipping insertion in model container [2020-07-10 20:21:11,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:11,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:11,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:11,683 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:11,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:11,730 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:11,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11 WrapperNode [2020-07-10 20:21:11,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:11,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:11,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:11,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:11,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (1/1) ... [2020-07-10 20:21:11,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:11,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:11,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:11,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:11,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (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-10 20:21:11,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:11,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:11,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:11,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:11,978 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:11,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:12,478 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:12,479 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 20:21:12,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:12 BoogieIcfgContainer [2020-07-10 20:21:12,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:12,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:12,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:12,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:12,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:11" (1/3) ... [2020-07-10 20:21:12,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34393429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:12, skipping insertion in model container [2020-07-10 20:21:12,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:11" (2/3) ... [2020-07-10 20:21:12,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34393429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:12, skipping insertion in model container [2020-07-10 20:21:12,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:12" (3/3) ... [2020-07-10 20:21:12,494 INFO L109 eAbstractionObserver]: Analyzing ICFG indp4f.c [2020-07-10 20:21:12,504 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:12,512 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:12,524 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:12,548 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:12,549 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:12,549 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:12,549 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:12,550 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:12,550 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:12,550 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:12,550 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2020-07-10 20:21:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:12,580 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:12,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:12,582 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1846170158, now seen corresponding path program 1 times [2020-07-10 20:21:12,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:12,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173545551] [2020-07-10 20:21:12,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:12,851 INFO L280 TraceCheckUtils]: 0: Hoare triple {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {66#true} is VALID [2020-07-10 20:21:12,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {66#true} #valid := #valid[0 := 0]; {66#true} is VALID [2020-07-10 20:21:12,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {66#true} assume 0 < #StackHeapBarrier; {66#true} is VALID [2020-07-10 20:21:12,853 INFO L280 TraceCheckUtils]: 3: Hoare triple {66#true} ~N~0 := 0; {66#true} is VALID [2020-07-10 20:21:12,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {66#true} assume true; {66#true} is VALID [2020-07-10 20:21:12,855 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {66#true} {66#true} #121#return; {66#true} is VALID [2020-07-10 20:21:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:12,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {66#true} ~cond := #in~cond; {66#true} is VALID [2020-07-10 20:21:12,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {66#true} assume !(0 == ~cond); {66#true} is VALID [2020-07-10 20:21:12,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {66#true} assume true; {66#true} is VALID [2020-07-10 20:21:12,868 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {66#true} {66#true} #117#return; {66#true} is VALID [2020-07-10 20:21:12,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {66#true} call ULTIMATE.init(); {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:12,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {66#true} is VALID [2020-07-10 20:21:12,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {66#true} #valid := #valid[0 := 0]; {66#true} is VALID [2020-07-10 20:21:12,872 INFO L280 TraceCheckUtils]: 3: Hoare triple {66#true} assume 0 < #StackHeapBarrier; {66#true} is VALID [2020-07-10 20:21:12,873 INFO L280 TraceCheckUtils]: 4: Hoare triple {66#true} ~N~0 := 0; {66#true} is VALID [2020-07-10 20:21:12,873 INFO L280 TraceCheckUtils]: 5: Hoare triple {66#true} assume true; {66#true} is VALID [2020-07-10 20:21:12,874 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {66#true} {66#true} #121#return; {66#true} is VALID [2020-07-10 20:21:12,874 INFO L263 TraceCheckUtils]: 7: Hoare triple {66#true} call #t~ret9 := main(); {66#true} is VALID [2020-07-10 20:21:12,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {66#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {66#true} is VALID [2020-07-10 20:21:12,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {66#true} ~N~0 := #t~nondet0; {66#true} is VALID [2020-07-10 20:21:12,875 INFO L280 TraceCheckUtils]: 10: Hoare triple {66#true} havoc #t~nondet0; {66#true} is VALID [2020-07-10 20:21:12,876 INFO L280 TraceCheckUtils]: 11: Hoare triple {66#true} assume !(~N~0 <= 0); {66#true} is VALID [2020-07-10 20:21:12,876 INFO L263 TraceCheckUtils]: 12: Hoare triple {66#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {66#true} is VALID [2020-07-10 20:21:12,877 INFO L280 TraceCheckUtils]: 13: Hoare triple {66#true} ~cond := #in~cond; {66#true} is VALID [2020-07-10 20:21:12,877 INFO L280 TraceCheckUtils]: 14: Hoare triple {66#true} assume !(0 == ~cond); {66#true} is VALID [2020-07-10 20:21:12,877 INFO L280 TraceCheckUtils]: 15: Hoare triple {66#true} assume true; {66#true} is VALID [2020-07-10 20:21:12,878 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {66#true} {66#true} #117#return; {66#true} is VALID [2020-07-10 20:21:12,878 INFO L280 TraceCheckUtils]: 17: Hoare triple {66#true} havoc ~i~0; {66#true} is VALID [2020-07-10 20:21:12,879 INFO L280 TraceCheckUtils]: 18: Hoare triple {66#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26 {66#true} is VALID [2020-07-10 20:21:12,879 INFO L280 TraceCheckUtils]: 19: Hoare triple {66#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {66#true} is VALID [2020-07-10 20:21:12,880 INFO L280 TraceCheckUtils]: 20: Hoare triple {66#true} ~i~0 := 0; {66#true} is VALID [2020-07-10 20:21:12,884 INFO L280 TraceCheckUtils]: 21: Hoare triple {66#true} assume !true; {67#false} is VALID [2020-07-10 20:21:12,885 INFO L280 TraceCheckUtils]: 22: Hoare triple {67#false} ~i~0 := 0; {67#false} is VALID [2020-07-10 20:21:12,885 INFO L280 TraceCheckUtils]: 23: Hoare triple {67#false} assume !true; {67#false} is VALID [2020-07-10 20:21:12,885 INFO L280 TraceCheckUtils]: 24: Hoare triple {67#false} ~i~0 := 0; {67#false} is VALID [2020-07-10 20:21:12,886 INFO L280 TraceCheckUtils]: 25: Hoare triple {67#false} assume !true; {67#false} is VALID [2020-07-10 20:21:12,886 INFO L280 TraceCheckUtils]: 26: Hoare triple {67#false} ~i~0 := 0; {67#false} is VALID [2020-07-10 20:21:12,887 INFO L280 TraceCheckUtils]: 27: Hoare triple {67#false} assume !!(~i~0 < ~N~0); {67#false} is VALID [2020-07-10 20:21:12,887 INFO L280 TraceCheckUtils]: 28: Hoare triple {67#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L45 {67#false} is VALID [2020-07-10 20:21:12,888 INFO L263 TraceCheckUtils]: 29: Hoare triple {67#false} call __VERIFIER_assert((if #t~mem8 == ~i~0 * ~i~0 then 1 else 0)); {67#false} is VALID [2020-07-10 20:21:12,888 INFO L280 TraceCheckUtils]: 30: Hoare triple {67#false} ~cond := #in~cond; {67#false} is VALID [2020-07-10 20:21:12,889 INFO L280 TraceCheckUtils]: 31: Hoare triple {67#false} assume 0 == ~cond; {67#false} is VALID [2020-07-10 20:21:12,889 INFO L280 TraceCheckUtils]: 32: Hoare triple {67#false} assume !false; {67#false} is VALID [2020-07-10 20:21:12,895 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-10 20:21:12,895 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:12,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173545551] [2020-07-10 20:21:12,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:12,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:12,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008000886] [2020-07-10 20:21:12,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:12,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:12,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:12,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:12,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:12,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:12,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:12,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:12,994 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 3 states. [2020-07-10 20:21:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:13,393 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2020-07-10 20:21:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:13,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-10 20:21:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-10 20:21:13,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2020-07-10 20:21:13,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:13,611 INFO L225 Difference]: With dead ends: 109 [2020-07-10 20:21:13,611 INFO L226 Difference]: Without dead ends: 56 [2020-07-10 20:21:13,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-10 20:21:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-10 20:21:13,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:13,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-10 20:21:13,721 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-10 20:21:13,721 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-10 20:21:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:13,728 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-10 20:21:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-10 20:21:13,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:13,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:13,729 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-10 20:21:13,730 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-10 20:21:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:13,736 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-10 20:21:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-10 20:21:13,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:13,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:13,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:13,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 20:21:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-07-10 20:21:13,744 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 33 [2020-07-10 20:21:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:13,744 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-07-10 20:21:13,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:13,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 59 transitions. [2020-07-10 20:21:13,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-10 20:21:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:13,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:13,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:13,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:13,837 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1457656721, now seen corresponding path program 1 times [2020-07-10 20:21:13,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:13,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255652017] [2020-07-10 20:21:13,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:13,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {537#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {523#true} is VALID [2020-07-10 20:21:13,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} #valid := #valid[0 := 0]; {523#true} is VALID [2020-07-10 20:21:13,964 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} assume 0 < #StackHeapBarrier; {523#true} is VALID [2020-07-10 20:21:13,965 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} ~N~0 := 0; {523#true} is VALID [2020-07-10 20:21:13,965 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 20:21:13,966 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {523#true} {523#true} #121#return; {523#true} is VALID [2020-07-10 20:21:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:13,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#true} ~cond := #in~cond; {523#true} is VALID [2020-07-10 20:21:13,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} assume !(0 == ~cond); {523#true} is VALID [2020-07-10 20:21:13,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 20:21:13,981 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {523#true} {531#(<= 1 ~N~0)} #117#return; {531#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:13,982 INFO L263 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {537#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:13,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {537#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {523#true} is VALID [2020-07-10 20:21:13,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} #valid := #valid[0 := 0]; {523#true} is VALID [2020-07-10 20:21:13,983 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} assume 0 < #StackHeapBarrier; {523#true} is VALID [2020-07-10 20:21:13,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} ~N~0 := 0; {523#true} is VALID [2020-07-10 20:21:13,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 20:21:13,984 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {523#true} {523#true} #121#return; {523#true} is VALID [2020-07-10 20:21:13,985 INFO L263 TraceCheckUtils]: 7: Hoare triple {523#true} call #t~ret9 := main(); {523#true} is VALID [2020-07-10 20:21:13,985 INFO L280 TraceCheckUtils]: 8: Hoare triple {523#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {523#true} is VALID [2020-07-10 20:21:13,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {523#true} ~N~0 := #t~nondet0; {523#true} is VALID [2020-07-10 20:21:13,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {523#true} havoc #t~nondet0; {523#true} is VALID [2020-07-10 20:21:13,987 INFO L280 TraceCheckUtils]: 11: Hoare triple {523#true} assume !(~N~0 <= 0); {531#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:13,988 INFO L263 TraceCheckUtils]: 12: Hoare triple {531#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {523#true} is VALID [2020-07-10 20:21:13,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#true} ~cond := #in~cond; {523#true} is VALID [2020-07-10 20:21:13,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {523#true} assume !(0 == ~cond); {523#true} is VALID [2020-07-10 20:21:13,989 INFO L280 TraceCheckUtils]: 15: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 20:21:13,990 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {523#true} {531#(<= 1 ~N~0)} #117#return; {531#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:13,991 INFO L280 TraceCheckUtils]: 17: Hoare triple {531#(<= 1 ~N~0)} havoc ~i~0; {531#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:13,992 INFO L280 TraceCheckUtils]: 18: Hoare triple {531#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26 {531#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:13,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {531#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {531#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:13,994 INFO L280 TraceCheckUtils]: 20: Hoare triple {531#(<= 1 ~N~0)} ~i~0 := 0; {536#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:13,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {536#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {524#false} is VALID [2020-07-10 20:21:13,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {524#false} ~i~0 := 0; {524#false} is VALID [2020-07-10 20:21:13,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {524#false} assume !(~i~0 < ~N~0); {524#false} is VALID [2020-07-10 20:21:13,996 INFO L280 TraceCheckUtils]: 24: Hoare triple {524#false} ~i~0 := 0; {524#false} is VALID [2020-07-10 20:21:13,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {524#false} assume !(~i~0 < ~N~0); {524#false} is VALID [2020-07-10 20:21:13,997 INFO L280 TraceCheckUtils]: 26: Hoare triple {524#false} ~i~0 := 0; {524#false} is VALID [2020-07-10 20:21:13,997 INFO L280 TraceCheckUtils]: 27: Hoare triple {524#false} assume !!(~i~0 < ~N~0); {524#false} is VALID [2020-07-10 20:21:13,998 INFO L280 TraceCheckUtils]: 28: Hoare triple {524#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L45 {524#false} is VALID [2020-07-10 20:21:13,998 INFO L263 TraceCheckUtils]: 29: Hoare triple {524#false} call __VERIFIER_assert((if #t~mem8 == ~i~0 * ~i~0 then 1 else 0)); {524#false} is VALID [2020-07-10 20:21:13,998 INFO L280 TraceCheckUtils]: 30: Hoare triple {524#false} ~cond := #in~cond; {524#false} is VALID [2020-07-10 20:21:13,999 INFO L280 TraceCheckUtils]: 31: Hoare triple {524#false} assume 0 == ~cond; {524#false} is VALID [2020-07-10 20:21:13,999 INFO L280 TraceCheckUtils]: 32: Hoare triple {524#false} assume !false; {524#false} is VALID [2020-07-10 20:21:14,001 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-10 20:21:14,002 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:14,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255652017] [2020-07-10 20:21:14,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:14,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:14,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075020276] [2020-07-10 20:21:14,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:14,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:14,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:14,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:14,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:14,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:14,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:14,055 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2020-07-10 20:21:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:14,725 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2020-07-10 20:21:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:14,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2020-07-10 20:21:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2020-07-10 20:21:14,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 117 transitions. [2020-07-10 20:21:14,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:14,893 INFO L225 Difference]: With dead ends: 108 [2020-07-10 20:21:14,894 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 20:21:14,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:21:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 20:21:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2020-07-10 20:21:15,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:15,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 59 states. [2020-07-10 20:21:15,010 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 59 states. [2020-07-10 20:21:15,010 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 59 states. [2020-07-10 20:21:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:15,017 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-07-10 20:21:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2020-07-10 20:21:15,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:15,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:15,019 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 78 states. [2020-07-10 20:21:15,019 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 78 states. [2020-07-10 20:21:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:15,024 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-07-10 20:21:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2020-07-10 20:21:15,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:15,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:15,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:15,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 20:21:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-07-10 20:21:15,029 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 33 [2020-07-10 20:21:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:15,030 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-07-10 20:21:15,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:15,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2020-07-10 20:21:15,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-10 20:21:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 20:21:15,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:15,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:15,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:15,115 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1203755678, now seen corresponding path program 1 times [2020-07-10 20:21:15,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:15,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [534981631] [2020-07-10 20:21:15,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:15,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:15,160 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) 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:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) 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:317) 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) [2020-07-10 20:21:15,170 INFO L168 Benchmark]: Toolchain (without parser) took 3766.03 ms. Allocated memory was 138.4 MB in the beginning and 248.0 MB in the end (delta: 109.6 MB). Free memory was 103.1 MB in the beginning and 112.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 100.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:15,174 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:15,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.81 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 92.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:15,177 INFO L168 Benchmark]: Boogie Preprocessor took 172.05 ms. Allocated memory was 138.4 MB in the beginning and 198.2 MB in the end (delta: 59.8 MB). Free memory was 92.0 MB in the beginning and 175.7 MB in the end (delta: -83.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:15,180 INFO L168 Benchmark]: RCFGBuilder took 580.01 ms. Allocated memory is still 198.2 MB. Free memory was 175.7 MB in the beginning and 147.4 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:15,182 INFO L168 Benchmark]: TraceAbstraction took 2678.12 ms. Allocated memory was 198.2 MB in the beginning and 248.0 MB in the end (delta: 49.8 MB). Free memory was 146.7 MB in the beginning and 112.5 MB in the end (delta: 34.2 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:15,192 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.81 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 92.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 172.05 ms. Allocated memory was 138.4 MB in the beginning and 198.2 MB in the end (delta: 59.8 MB). Free memory was 92.0 MB in the beginning and 175.7 MB in the end (delta: -83.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 580.01 ms. Allocated memory is still 198.2 MB. Free memory was 175.7 MB in the beginning and 147.4 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2678.12 ms. Allocated memory was 198.2 MB in the beginning and 248.0 MB in the end (delta: 49.8 MB). Free memory was 146.7 MB in the beginning and 112.5 MB in the end (delta: 34.2 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...