/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:54:22,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:54:22,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:54:22,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:54:22,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:54:22,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:54:22,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:54:22,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:54:22,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:54:22,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:54:22,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:54:22,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:54:22,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:54:22,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:54:22,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:54:22,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:54:22,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:54:22,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:54:22,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:54:22,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:54:22,782 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:54:22,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:54:22,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:54:22,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:54:22,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:54:22,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:54:22,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:54:22,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:54:22,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:54:22,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:54:22,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:54:22,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:54:22,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:54:22,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:54:22,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:54:22,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:54:22,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:54:22,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:54:22,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:54:22,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:54:22,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:54:22,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:54:22,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:54:22,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:54:22,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:54:22,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:54:22,824 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:54:22,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:54:22,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:54:22,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:54:22,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:54:22,825 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:54:22,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:54:22,826 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:54:22,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:54:22,828 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:54:22,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:54:22,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:54:22,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:54:22,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:54:22,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:54:22,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:54:22,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:54:22,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:54:22,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:54:22,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:54:22,830 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:54:22,830 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:54:22,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:54:22,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:54:23,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:54:23,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:54:23,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:54:23,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:54:23,082 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:54:23,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-27 10:54:23,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc5c6d67/6b6e072262b345969059e6ac2acff2ce/FLAG5f83562ec [2022-04-27 10:54:23,487 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:54:23,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-27 10:54:23,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc5c6d67/6b6e072262b345969059e6ac2acff2ce/FLAG5f83562ec [2022-04-27 10:54:23,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc5c6d67/6b6e072262b345969059e6ac2acff2ce [2022-04-27 10:54:23,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:54:23,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:54:23,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:54:23,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:54:23,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:54:23,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:54:23" (1/1) ... [2022-04-27 10:54:23,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f09c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:23, skipping insertion in model container [2022-04-27 10:54:23,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:54:23" (1/1) ... [2022-04-27 10:54:23,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:54:23,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:54:24,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-27 10:54:24,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:54:24,124 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:54:24,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-27 10:54:24,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:54:24,167 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:54:24,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24 WrapperNode [2022-04-27 10:54:24,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:54:24,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:54:24,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:54:24,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:54:24,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:54:24,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:54:24,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:54:24,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:54:24,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (1/1) ... [2022-04-27 10:54:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:54:24,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:24,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:54:24,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:54:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:54:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:54:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:54:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:54:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:54:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:54:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:54:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:54:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:54:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:54:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:54:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:54:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:54:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:54:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:54:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:54:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:54:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:54:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:54:24,313 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:54:24,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:54:24,436 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:54:24,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:54:24,442 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:54:24,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:54:24 BoogieIcfgContainer [2022-04-27 10:54:24,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:54:24,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:54:24,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:54:24,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:54:24,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:54:23" (1/3) ... [2022-04-27 10:54:24,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6208c7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:54:24, skipping insertion in model container [2022-04-27 10:54:24,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:54:24" (2/3) ... [2022-04-27 10:54:24,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6208c7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:54:24, skipping insertion in model container [2022-04-27 10:54:24,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:54:24" (3/3) ... [2022-04-27 10:54:24,464 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+lhb-reducer.c [2022-04-27 10:54:24,487 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:54:24,488 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:54:24,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:54:24,533 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6584da2e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33ac2c5b [2022-04-27 10:54:24,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:54:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:54:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:54:24,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:24,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:24,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444895, now seen corresponding path program 1 times [2022-04-27 10:54:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:24,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504303203] [2022-04-27 10:54:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:24,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:24,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:54:24,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074544153] [2022-04-27 10:54:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:24,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:24,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:54:24,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:54:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:24,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 10:54:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:24,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:25,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-27 10:54:25,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {24#true} is VALID [2022-04-27 10:54:25,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:54:25,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-27 10:54:25,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-27 10:54:25,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2022-04-27 10:54:25,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~main__n~0); {24#true} is VALID [2022-04-27 10:54:25,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-27 10:54:25,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-27 10:54:25,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-27 10:54:25,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-27 10:54:25,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-27 10:54:25,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} is VALID [2022-04-27 10:54:25,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {74#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 10:54:25,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {74#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {25#false} is VALID [2022-04-27 10:54:25,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 10:54:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:54:25,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:54:25,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:25,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504303203] [2022-04-27 10:54:25,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:54:25,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074544153] [2022-04-27 10:54:25,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074544153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:54:25,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:54:25,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 10:54:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4880679] [2022-04-27 10:54:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:54:25,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:54:25,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:25,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:25,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 10:54:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 10:54:25,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:54:25,373 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:25,753 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 10:54:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:54:25,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:54:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 10:54:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 10:54:25,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 10:54:25,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:25,818 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:54:25,819 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 10:54:25,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:54:25,824 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:25,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:54:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 10:54:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 10:54:25,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:25,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,849 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,849 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:25,851 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:54:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:54:25,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:25,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:25,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:54:25,853 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:54:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:25,855 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:54:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:54:25,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:25,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:25,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:25,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 10:54:25,858 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-27 10:54:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:25,859 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 10:54:25,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:54:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:54:25,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:25,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:25,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:54:26,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 10:54:26,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1718213942, now seen corresponding path program 1 times [2022-04-27 10:54:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725230288] [2022-04-27 10:54:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:26,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:54:26,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [870577804] [2022-04-27 10:54:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:26,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:26,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:54:26,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:54:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 10:54:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:26,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:26,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2022-04-27 10:54:26,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {189#true} is VALID [2022-04-27 10:54:26,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-27 10:54:26,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #58#return; {189#true} is VALID [2022-04-27 10:54:26,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret5 := main(); {189#true} is VALID [2022-04-27 10:54:26,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {189#true} is VALID [2022-04-27 10:54:26,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#true} assume !!(1 <= ~main__n~0); {189#true} is VALID [2022-04-27 10:54:26,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {215#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-27 10:54:26,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {219#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-27 10:54:26,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {223#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-27 10:54:26,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {227#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} is VALID [2022-04-27 10:54:26,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {227#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {231#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} is VALID [2022-04-27 10:54:26,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {235#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0))} is VALID [2022-04-27 10:54:26,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {239#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} is VALID [2022-04-27 10:54:26,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {243#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 10:54:26,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {190#false} is VALID [2022-04-27 10:54:26,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-04-27 10:54:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:54:26,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:54:27,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-04-27 10:54:27,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {190#false} is VALID [2022-04-27 10:54:27,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {243#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 10:54:27,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {256#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-27 10:54:27,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:27,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:27,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:27,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:27,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:27,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:27,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#true} assume !!(1 <= ~main__n~0); {189#true} is VALID [2022-04-27 10:54:27,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {189#true} is VALID [2022-04-27 10:54:27,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret5 := main(); {189#true} is VALID [2022-04-27 10:54:27,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #58#return; {189#true} is VALID [2022-04-27 10:54:27,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-27 10:54:27,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {189#true} is VALID [2022-04-27 10:54:27,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2022-04-27 10:54:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:54:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:27,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725230288] [2022-04-27 10:54:27,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:54:27,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870577804] [2022-04-27 10:54:27,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870577804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:54:27,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:54:27,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2022-04-27 10:54:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770799364] [2022-04-27 10:54:27,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:54:27,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:54:27,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:27,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:27,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:27,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:54:27,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:54:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:54:27,817 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:28,061 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:54:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:54:28,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:54:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-27 10:54:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-27 10:54:28,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2022-04-27 10:54:28,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:28,091 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:54:28,091 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 10:54:28,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:54:28,093 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:28,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-04-27 10:54:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 10:54:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 10:54:28,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:28,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,100 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,100 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:28,101 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:54:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:54:28,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:28,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:28,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 10:54:28,102 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 10:54:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:28,104 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:54:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:54:28,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:28,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:28,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:28,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-27 10:54:28,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-27 10:54:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:28,106 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-27 10:54:28,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:54:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:54:28,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:54:28,107 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:54:28,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:54:28,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 10:54:28,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:54:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:54:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1725087103, now seen corresponding path program 2 times [2022-04-27 10:54:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:54:28,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99242176] [2022-04-27 10:54:28,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:54:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:54:28,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:54:28,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669421190] [2022-04-27 10:54:28,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:54:28,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:28,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:54:28,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:54:28,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:54:28,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:54:28,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:54:28,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 10:54:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:54:28,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:54:28,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2022-04-27 10:54:28,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {407#true} is VALID [2022-04-27 10:54:28,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-27 10:54:28,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #58#return; {407#true} is VALID [2022-04-27 10:54:28,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret5 := main(); {407#true} is VALID [2022-04-27 10:54:28,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {407#true} is VALID [2022-04-27 10:54:28,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} assume !!(1 <= ~main__n~0); {407#true} is VALID [2022-04-27 10:54:28,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {433#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-27 10:54:28,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {437#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-27 10:54:28,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {441#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-27 10:54:28,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {445#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} is VALID [2022-04-27 10:54:28,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {449#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-27 10:54:28,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {449#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {453#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-27 10:54:28,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {453#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {457#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} is VALID [2022-04-27 10:54:28,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {457#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {461#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2022-04-27 10:54:28,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {465#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 10:54:28,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {408#false} is VALID [2022-04-27 10:54:28,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {408#false} assume !false; {408#false} is VALID [2022-04-27 10:54:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:54:28,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:54:29,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {408#false} assume !false; {408#false} is VALID [2022-04-27 10:54:29,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {408#false} is VALID [2022-04-27 10:54:29,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {478#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {465#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 10:54:29,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {478#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-27 10:54:29,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:29,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:29,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:29,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:29,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:29,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:29,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-27 10:54:29,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} assume !!(1 <= ~main__n~0); {407#true} is VALID [2022-04-27 10:54:29,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {407#true} is VALID [2022-04-27 10:54:29,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret5 := main(); {407#true} is VALID [2022-04-27 10:54:29,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #58#return; {407#true} is VALID [2022-04-27 10:54:29,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-27 10:54:29,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {407#true} is VALID [2022-04-27 10:54:29,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2022-04-27 10:54:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:54:29,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:54:29,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99242176] [2022-04-27 10:54:29,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:54:29,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669421190] [2022-04-27 10:54:29,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669421190] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:54:29,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:54:29,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2022-04-27 10:54:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157642437] [2022-04-27 10:54:29,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:54:29,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:54:29,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:54:29,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:30,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:30,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 10:54:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:54:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 10:54:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:54:30,032 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:30,426 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 10:54:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:54:30,427 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:54:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:54:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2022-04-27 10:54:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2022-04-27 10:54:30,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 21 transitions. [2022-04-27 10:54:30,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:54:30,485 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:54:30,485 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:54:30,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:54:30,486 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:54:30,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 3 Unchecked, 0.1s Time] [2022-04-27 10:54:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:54:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:54:30,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:54:30,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:54:30,488 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:54:30,488 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:54:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:30,488 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:54:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:54:30,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:30,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:30,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:54:30,489 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:54:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:54:30,489 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:54:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:54:30,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:30,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:54:30,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:54:30,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:54:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:54:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:54:30,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 10:54:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:54:30,490 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:54:30,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:54:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:54:30,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:54:30,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:54:30,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:54:30,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:54:30,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:54:30,807 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 10:54:30,807 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 10:54:30,807 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 10:54:30,808 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:54:30,808 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:54:30,808 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:54:30,808 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:54:30,808 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 103) no Hoare annotation was computed. [2022-04-27 10:54:30,808 INFO L895 garLoopResultBuilder]: At program point L58(lines 50 79) the Hoare annotation is: (and (forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))) (or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))) [2022-04-27 10:54:30,808 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 104) no Hoare annotation was computed. [2022-04-27 10:54:30,808 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 106) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 105) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 106) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 76) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 106) the Hoare annotation is: true [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 83) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 88) no Hoare annotation was computed. [2022-04-27 10:54:30,809 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 93) no Hoare annotation was computed. [2022-04-27 10:54:30,810 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 98) no Hoare annotation was computed. [2022-04-27 10:54:30,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:54:30,810 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:54:30,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:54:30,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:54:30,810 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:54:30,810 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:54:30,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:54:30,813 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 10:54:30,814 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:54:30,817 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 10:54:30,818 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 10:54:30,819 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 10:54:30,829 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-27 10:54:30,829 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-27 10:54:30,829 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-27 10:54:30,829 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-27 10:54:30,829 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-27 10:54:30,829 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:54:30,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:54:30 BoogieIcfgContainer [2022-04-27 10:54:30,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:54:30,839 INFO L158 Benchmark]: Toolchain (without parser) took 6910.10ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 149.8MB in the beginning and 193.6MB in the end (delta: -43.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:54:30,839 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:54:30,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.72ms. Allocated memory is still 198.2MB. Free memory was 149.6MB in the beginning and 175.8MB in the end (delta: -26.3MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-27 10:54:30,840 INFO L158 Benchmark]: Boogie Preprocessor took 36.26ms. Allocated memory is still 198.2MB. Free memory was 175.8MB in the beginning and 174.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:54:30,840 INFO L158 Benchmark]: RCFGBuilder took 238.75ms. Allocated memory is still 198.2MB. Free memory was 174.3MB in the beginning and 161.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:54:30,840 INFO L158 Benchmark]: TraceAbstraction took 6393.16ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 161.2MB in the beginning and 193.6MB in the end (delta: -32.4MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-04-27 10:54:30,841 INFO L339 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.12ms. Allocated memory is still 198.2MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.72ms. Allocated memory is still 198.2MB. Free memory was 149.6MB in the beginning and 175.8MB in the end (delta: -26.3MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.26ms. Allocated memory is still 198.2MB. Free memory was 175.8MB in the beginning and 174.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 238.75ms. Allocated memory is still 198.2MB. Free memory was 174.3MB in the beginning and 161.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6393.16ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 161.2MB in the beginning and 193.6MB in the end (delta: -32.4MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 45 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 42 HoareAnnotationTreeSize, 5 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 13 QuantifiedInterpolants, 618 SizeOfPredicates, 14 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant [2022-04-27 10:54:30,847 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,847 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,847 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,847 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,847 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,847 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,848 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,848 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,848 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-27 10:54:30,848 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] Derived loop invariant: (forall main_~main__n~0 : int :: (main__i + 1 <= main_~main__n~0 || !(main__i <= main_~main__n~0)) || main_~main__n~0 * main_~main__n~0 + main_~main__n~0 == main__sum * 2 + 2 * main__i) && (main__sum * 2 == main__n * main__n + main__n || main__i <= main__n) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:54:30,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...