/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.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 11:38:50,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 11:38:50,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 11:38:50,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 11:38:50,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 11:38:50,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 11:38:50,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 11:38:50,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 11:38:50,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 11:38:50,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 11:38:50,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 11:38:50,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 11:38:50,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 11:38:50,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 11:38:50,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 11:38:50,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 11:38:50,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 11:38:50,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 11:38:50,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 11:38:50,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 11:38:50,104 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 11:38:50,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 11:38:50,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 11:38:50,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 11:38:50,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 11:38:50,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 11:38:50,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 11:38:50,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 11:38:50,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 11:38:50,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 11:38:50,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 11:38:50,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 11:38:50,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 11:38:50,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 11:38:50,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 11:38:50,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 11:38:50,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 11:38:50,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 11:38:50,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 11:38:50,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 11:38:50,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 11:38:50,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 11:38:50,128 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-07 11:38:50,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 11:38:50,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 11:38:50,163 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 11:38:50,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 11:38:50,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 11:38:50,164 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 11:38:50,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 11:38:50,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 11:38:50,164 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 11:38:50,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 11:38:50,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 11:38:50,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 11:38:50,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 11:38:50,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 11:38:50,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 11:38:50,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 11:38:50,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 11:38:50,166 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 11:38:50,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 11:38:50,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 11:38:50,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 11:38:50,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 11:38:50,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 11:38:50,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 11:38:50,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:38:50,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 11:38:50,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 11:38:50,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 11:38:50,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 11:38:50,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 11:38:50,170 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 11:38:50,170 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 11:38:50,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 11:38:50,170 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-07 11:38:50,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 11:38:50,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 11:38:50,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 11:38:50,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 11:38:50,425 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 11:38:50,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2022-04-07 11:38:50,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44f5ac27/c8f48e00d6d14ea18c22781cee6eae0c/FLAGc84f40fe5 [2022-04-07 11:38:50,859 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 11:38:50,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2022-04-07 11:38:50,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44f5ac27/c8f48e00d6d14ea18c22781cee6eae0c/FLAGc84f40fe5 [2022-04-07 11:38:50,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44f5ac27/c8f48e00d6d14ea18c22781cee6eae0c [2022-04-07 11:38:50,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 11:38:50,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 11:38:50,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 11:38:50,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 11:38:50,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 11:38:50,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:38:50" (1/1) ... [2022-04-07 11:38:50,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a381d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:50, skipping insertion in model container [2022-04-07 11:38:50,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:38:50" (1/1) ... [2022-04-07 11:38:50,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 11:38:50,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 11:38:51,037 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.v+cfa-reducer.c[1014,1027] [2022-04-07 11:38:51,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:38:51,047 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 11:38:51,060 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.v+cfa-reducer.c[1014,1027] [2022-04-07 11:38:51,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:38:51,072 INFO L208 MainTranslator]: Completed translation [2022-04-07 11:38:51,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51 WrapperNode [2022-04-07 11:38:51,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 11:38:51,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 11:38:51,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 11:38:51,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 11:38:51,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 11:38:51,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 11:38:51,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 11:38:51,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 11:38:51,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (1/1) ... [2022-04-07 11:38:51,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:38:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:38:51,141 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-07 11:38:51,142 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-07 11:38:51,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 11:38:51,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 11:38:51,167 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 11:38:51,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 11:38:51,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 11:38:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 11:38:51,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 11:38:51,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 11:38:51,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 11:38:51,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 11:38:51,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 11:38:51,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 11:38:51,222 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 11:38:51,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 11:38:51,326 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 11:38:51,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 11:38:51,333 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 11:38:51,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:38:51 BoogieIcfgContainer [2022-04-07 11:38:51,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 11:38:51,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 11:38:51,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 11:38:51,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 11:38:51,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:38:50" (1/3) ... [2022-04-07 11:38:51,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381ad50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:38:51, skipping insertion in model container [2022-04-07 11:38:51,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:38:51" (2/3) ... [2022-04-07 11:38:51,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381ad50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:38:51, skipping insertion in model container [2022-04-07 11:38:51,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:38:51" (3/3) ... [2022-04-07 11:38:51,342 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.v+cfa-reducer.c [2022-04-07 11:38:51,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 11:38:51,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 11:38:51,399 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 11:38:51,413 INFO L340 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 [2022-04-07 11:38:51,413 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 11:38:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-07 11:38:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 11:38:51,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:38:51,446 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:38:51,447 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:38:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:38:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1088558671, now seen corresponding path program 1 times [2022-04-07 11:38:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:38:51,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787343248] [2022-04-07 11:38:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:38:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:38:51,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 11:38:51,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291794507] [2022-04-07 11:38:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:38:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:38:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:38:51,552 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-07 11:38:51,553 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-07 11:38:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:38:51,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 11:38:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:38:51,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:38:51,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2022-04-07 11:38:51,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#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_60~0 := 0; {19#true} is VALID [2022-04-07 11:38:51,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-07 11:38:51,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #38#return; {19#true} is VALID [2022-04-07 11:38:51,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-07 11:38:51,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#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; {19#true} is VALID [2022-04-07 11:38:51,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!(1 <= ~main__n~0); {42#(<= 1 main_~main__n~0)} is VALID [2022-04-07 11:38:51,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} is VALID [2022-04-07 11:38:51,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#(and (<= main_~main__i~0 1) (<= 1 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; {20#false} is VALID [2022-04-07 11:38:51,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2022-04-07 11:38:51,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-07 11:38:51,782 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-07 11:38:51,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 11:38:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:38:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787343248] [2022-04-07 11:38:51,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 11:38:51,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291794507] [2022-04-07 11:38:51,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291794507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:38:51,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:38:51,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 11:38:51,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499499785] [2022-04-07 11:38:51,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:38:51,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2022-04-07 11:38:51,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:38:51,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 11:38:51,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:38:51,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 11:38:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:38:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 11:38:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 11:38:51,856 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 11:38:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:51,935 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 11:38:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 11:38:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2022-04-07 11:38:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:38:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 11:38:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 11:38:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 11:38:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 11:38:51,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-07 11:38:51,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:38:51,997 INFO L225 Difference]: With dead ends: 26 [2022-04-07 11:38:51,997 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 11:38:52,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 11:38:52,004 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:38:52,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 11:38:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 11:38:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 11:38:52,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:38:52,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 11:38:52,038 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 11:38:52,039 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 11:38:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:52,045 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 11:38:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 11:38:52,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:38:52,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:38:52,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-07 11:38:52,046 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-07 11:38:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:52,050 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 11:38:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 11:38:52,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:38:52,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:38:52,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:38:52,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:38:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 11:38:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 11:38:52,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-07 11:38:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:38:52,063 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 11:38:52,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 11:38:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 11:38:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 11:38:52,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:38:52,064 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:38:52,094 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-07 11:38:52,275 WARN L460 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-07 11:38:52,276 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:38:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:38:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash 614357099, now seen corresponding path program 1 times [2022-04-07 11:38:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:38:52,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332053783] [2022-04-07 11:38:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:38:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:38:52,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 11:38:52,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76928499] [2022-04-07 11:38:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:38:52,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:38:52,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:38:52,298 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-07 11:38:52,308 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-07 11:38:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:38:52,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 11:38:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:38:52,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:38:52,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2022-04-07 11:38:52,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#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_60~0 := 0; {132#true} is VALID [2022-04-07 11:38:52,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-07 11:38:52,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #38#return; {132#true} is VALID [2022-04-07 11:38:52,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret5 := main(); {132#true} is VALID [2022-04-07 11:38:52,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#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; {132#true} is VALID [2022-04-07 11:38:52,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!(1 <= ~main__n~0); {155#(<= 1 main_~main__n~0)} is VALID [2022-04-07 11:38:52,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {159#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-07 11:38:52,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (<= 1 main_~main__n~0) (= 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; {163#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 1) (<= main_~main__i~0 (+ main_~main__sum~0 1)))} is VALID [2022-04-07 11:38:52,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 1) (<= main_~main__i~0 (+ main_~main__sum~0 1)))} 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; {167#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 11:38:52,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2022-04-07 11:38:52,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-04-07 11:38:52,725 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-07 11:38:52,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:38:52,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-04-07 11:38:52,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2022-04-07 11:38:52,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {180#(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; {167#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 11:38:52,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#(or (<= (+ main_~main__i~0 1) 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; {180#(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-07 11:38:52,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(or (= 2 (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= 2 main_~main__n~0))} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {184#(or (<= (+ main_~main__i~0 1) 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-07 11:38:52,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!(1 <= ~main__n~0); {188#(or (= 2 (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= 2 main_~main__n~0))} is VALID [2022-04-07 11:38:52,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#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; {132#true} is VALID [2022-04-07 11:38:52,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret5 := main(); {132#true} is VALID [2022-04-07 11:38:52,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #38#return; {132#true} is VALID [2022-04-07 11:38:52,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-07 11:38:52,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#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_60~0 := 0; {132#true} is VALID [2022-04-07 11:38:52,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2022-04-07 11:38:52,993 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-07 11:38:52,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:38:52,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332053783] [2022-04-07 11:38:52,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 11:38:52,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76928499] [2022-04-07 11:38:52,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76928499] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:38:52,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 11:38:52,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-07 11:38:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620988444] [2022-04-07 11:38:52,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 11:38:52,998 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 12 [2022-04-07 11:38:52,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:38:52,998 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-07 11:38:53,019 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-07 11:38:53,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 11:38:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:38:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 11:38:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 11:38:53,020 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. 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-07 11:38:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:53,118 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-07 11:38:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 11:38:53,118 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 12 [2022-04-07 11:38:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:38:53,119 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-07 11:38:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-07 11:38:53,129 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-07 11:38:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-07 11:38:53,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-07 11:38:53,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:38:53,147 INFO L225 Difference]: With dead ends: 17 [2022-04-07 11:38:53,148 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 11:38:53,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-07 11:38:53,151 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:38:53,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 11:38:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 11:38:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 11:38:53,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:38:53,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 11:38:53,160 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 11:38:53,160 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 11:38:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:53,161 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 11:38:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 11:38:53,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:38:53,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:38:53,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-07 11:38:53,163 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-07 11:38:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:53,165 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 11:38:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 11:38:53,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:38:53,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:38:53,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:38:53,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:38:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 11:38:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 11:38:53,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-07 11:38:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:38:53,168 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 11:38:53,168 INFO L479 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-07 11:38:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 11:38:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 11:38:53,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:38:53,169 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:38:53,194 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-07 11:38:53,392 WARN L460 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-07 11:38:53,392 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:38:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:38:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1865138417, now seen corresponding path program 2 times [2022-04-07 11:38:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:38:53,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203530440] [2022-04-07 11:38:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:38:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:38:53,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 11:38:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889003108] [2022-04-07 11:38:53,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:38:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:38:53,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:38:53,413 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-07 11:38:53,415 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-07 11:38:53,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:38:53,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:38:53,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 11:38:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:38:53,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:38:53,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} call ULTIMATE.init(); {287#true} is VALID [2022-04-07 11:38:53,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#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_60~0 := 0; {287#true} is VALID [2022-04-07 11:38:53,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume true; {287#true} is VALID [2022-04-07 11:38:53,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} #38#return; {287#true} is VALID [2022-04-07 11:38:53,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} call #t~ret5 := main(); {287#true} is VALID [2022-04-07 11:38:53,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#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; {287#true} is VALID [2022-04-07 11:38:53,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} assume !!(1 <= ~main__n~0); {287#true} is VALID [2022-04-07 11:38:53,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {313#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-07 11:38:53,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(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; {317#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-07 11:38:53,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {317#(and (= (+ main_~main__sum~0 1) 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; {321#(and (<= main_~main__i~0 3) (<= 2 main_~main__n~0) (= main_~main__sum~0 3))} is VALID [2022-04-07 11:38:53,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {321#(and (<= main_~main__i~0 3) (<= 2 main_~main__n~0) (= main_~main__sum~0 3))} 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; {325#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 11:38:53,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {288#false} is VALID [2022-04-07 11:38:53,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-04-07 11:38:53,702 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-07 11:38:53,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:38:54,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-04-07 11:38:54,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {288#false} is VALID [2022-04-07 11:38:54,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {338#(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; {325#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 11:38:54,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#(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; {338#(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-07 11:38:54,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(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; {342#(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-07 11:38:54,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {342#(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-07 11:38:54,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} assume !!(1 <= ~main__n~0); {287#true} is VALID [2022-04-07 11:38:54,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#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; {287#true} is VALID [2022-04-07 11:38:54,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} call #t~ret5 := main(); {287#true} is VALID [2022-04-07 11:38:54,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} #38#return; {287#true} is VALID [2022-04-07 11:38:54,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume true; {287#true} is VALID [2022-04-07 11:38:54,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#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_60~0 := 0; {287#true} is VALID [2022-04-07 11:38:54,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} call ULTIMATE.init(); {287#true} is VALID [2022-04-07 11:38:54,184 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-07 11:38:54,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:38:54,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203530440] [2022-04-07 11:38:54,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 11:38:54,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889003108] [2022-04-07 11:38:54,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889003108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:38:54,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 11:38:54,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2022-04-07 11:38:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992240643] [2022-04-07 11:38:54,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 11:38:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 13 [2022-04-07 11:38:54,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:38:54,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 11:38:54,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:38:54,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 11:38:54,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:38:54,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 11:38:54,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 11:38:54,216 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 11:38:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:54,385 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 11:38:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:38:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 13 [2022-04-07 11:38:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:38:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 11:38:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-07 11:38:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 11:38:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-07 11:38:54,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2022-04-07 11:38:54,426 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-07 11:38:54,427 INFO L225 Difference]: With dead ends: 15 [2022-04-07 11:38:54,427 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 11:38:54,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-07 11:38:54,428 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:38:54,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-04-07 11:38:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 11:38:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 11:38:54,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:38:54,430 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-07 11:38:54,430 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-07 11:38:54,430 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-07 11:38:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:54,430 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 11:38:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:38:54,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:38:54,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:38:54,431 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-07 11:38:54,431 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-07 11:38:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:38:54,431 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 11:38:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:38:54,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:38:54,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:38:54,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:38:54,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:38:54,432 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-07 11:38:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 11:38:54,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-07 11:38:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:38:54,432 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 11:38:54,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 11:38:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:38:54,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:38:54,435 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 11:38:54,461 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-07 11:38:54,647 WARN L460 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-07 11:38:54,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 11:38:54,765 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-07 11:38:54,765 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-07 11:38:54,765 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-07 11:38:54,765 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-07 11:38:54,765 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-07 11:38:54,766 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-07 11:38:54,766 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-07 11:38:54,766 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 49) no Hoare annotation was computed. [2022-04-07 11:38:54,766 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 61) the Hoare annotation is: true [2022-04-07 11:38:54,766 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 59) no Hoare annotation was computed. [2022-04-07 11:38:54,766 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 61) no Hoare annotation was computed. [2022-04-07 11:38:54,766 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 60) no Hoare annotation was computed. [2022-04-07 11:38:54,767 INFO L882 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-07 11:38:54,767 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 56) no Hoare annotation was computed. [2022-04-07 11:38:54,767 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 61) no Hoare annotation was computed. [2022-04-07 11:38:54,767 INFO L878 garLoopResultBuilder]: At program point L38(lines 30 59) 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))))) (<= 1 main_~main__n~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-07 11:38:54,767 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 11:38:54,767 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-07 11:38:54,767 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 11:38:54,767 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 11:38:54,768 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 11:38:54,768 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 11:38:54,768 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 11:38:54,771 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-07 11:38:54,772 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 11:38:54,775 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-07 11:38:54,776 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 11:38:54,777 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 11:38:54,777 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 11:38:54,777 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 11:38:54,793 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 11:38:54,793 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 11:38:54,793 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 11:38:54,793 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 11:38:54,793 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 11:38:54,793 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-07 11:38:54,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:38:54 BoogieIcfgContainer [2022-04-07 11:38:54,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 11:38:54,808 INFO L158 Benchmark]: Toolchain (without parser) took 3928.46ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 120.1MB in the beginning and 174.5MB in the end (delta: -54.4MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. [2022-04-07 11:38:54,808 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 11:38:54,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.94ms. Allocated memory is still 169.9MB. Free memory was 119.8MB in the beginning and 147.2MB in the end (delta: -27.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 11:38:54,809 INFO L158 Benchmark]: Boogie Preprocessor took 32.85ms. Allocated memory is still 169.9MB. Free memory was 147.2MB in the beginning and 146.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 11:38:54,809 INFO L158 Benchmark]: RCFGBuilder took 228.00ms. Allocated memory is still 169.9MB. Free memory was 145.7MB in the beginning and 135.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 11:38:54,809 INFO L158 Benchmark]: TraceAbstraction took 3470.10ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 135.0MB in the beginning and 174.5MB in the end (delta: -39.5MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-04-07 11:38:54,811 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.17ms. Allocated memory is still 169.9MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.94ms. Allocated memory is still 169.9MB. Free memory was 119.8MB in the beginning and 147.2MB in the end (delta: -27.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.85ms. Allocated memory is still 169.9MB. Free memory was 147.2MB in the beginning and 146.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.00ms. Allocated memory is still 169.9MB. Free memory was 145.7MB in the beginning and 135.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3470.10ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 135.0MB in the beginning and 174.5MB in the end (delta: -39.5MB). Peak memory consumption was 18.2MB. 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: 49]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 33 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 45 HoareAnnotationTreeSize, 5 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 56 ConstructedInterpolants, 2 QuantifiedInterpolants, 215 SizeOfPredicates, 12 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 31 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: 30]: Loop Invariant [2022-04-07 11:38:54,823 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 11:38:54,825 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) && 1 <= main__n) && (main__sum * 2 == main__n * main__n + main__n || main__i <= main__n) RESULT: Ultimate proved your program to be correct! [2022-04-07 11:38:54,835 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...