/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/nla-digbench-scaling/cohencu-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:57:44,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:57:44,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:57:44,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:57:44,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:57:44,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:57:44,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:57:44,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:57:44,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:57:44,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:57:44,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:57:44,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:57:44,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:57:44,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:57:44,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:57:44,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:57:44,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:57:44,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:57:44,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:57:44,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:57:44,240 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:57:44,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:57:44,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:57:44,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:57:44,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:57:44,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:57:44,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:57:44,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:57:44,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:57:44,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:57:44,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:57:44,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:57:44,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:57:44,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:57:44,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:57:44,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:57:44,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:57:44,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:57:44,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:57:44,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:57:44,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:57:44,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:57:44,254 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 12:57:44,269 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:57:44,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:57:44,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:57:44,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:57:44,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:57:44,270 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:57:44,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:57:44,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:57:44,270 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:57:44,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:57:44,271 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:57:44,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:57:44,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:57:44,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:57:44,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:57:44,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:57:44,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:57:44,272 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:57:44,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:57:44,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:57:44,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:57:44,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:57:44,274 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:57:44,274 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:57:44,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:57:44,274 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 12:57:44,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:57:44,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:57:44,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:57:44,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:57:44,476 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:57:44,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound10.c [2022-04-07 12:57:44,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431b19642/dc238f1811f64425a0caf152d1a90224/FLAG699179ed9 [2022-04-07 12:57:44,910 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:57:44,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound10.c [2022-04-07 12:57:44,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431b19642/dc238f1811f64425a0caf152d1a90224/FLAG699179ed9 [2022-04-07 12:57:44,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431b19642/dc238f1811f64425a0caf152d1a90224 [2022-04-07 12:57:44,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:57:44,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:57:44,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:57:44,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:57:44,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:57:44,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:57:44" (1/1) ... [2022-04-07 12:57:44,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2090d7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:44, skipping insertion in model container [2022-04-07 12:57:44,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:57:44" (1/1) ... [2022-04-07 12:57:44,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:57:44,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:57:45,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound10.c[588,601] [2022-04-07 12:57:45,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:57:45,076 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:57:45,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound10.c[588,601] [2022-04-07 12:57:45,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:57:45,101 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:57:45,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45 WrapperNode [2022-04-07 12:57:45,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:57:45,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:57:45,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:57:45,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:57:45,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:57:45,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:57:45,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:57:45,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:57:45,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (1/1) ... [2022-04-07 12:57:45,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:57:45,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:45,151 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 12:57:45,152 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 12:57:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:57:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:57:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:57:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:57:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:57:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:57:45,212 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:57:45,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:57:45,306 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:57:45,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:57:45,311 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:57:45,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:57:45 BoogieIcfgContainer [2022-04-07 12:57:45,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:57:45,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:57:45,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:57:45,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:57:45,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:57:44" (1/3) ... [2022-04-07 12:57:45,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edb0e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:57:45, skipping insertion in model container [2022-04-07 12:57:45,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:45" (2/3) ... [2022-04-07 12:57:45,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edb0e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:57:45, skipping insertion in model container [2022-04-07 12:57:45,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:57:45" (3/3) ... [2022-04-07 12:57:45,318 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound10.c [2022-04-07 12:57:45,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:57:45,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:57:45,364 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:57:45,369 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 12:57:45,369 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:57:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:57:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:57:45,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:45,386 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:45,386 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-07 12:57:45,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:45,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44241138] [2022-04-07 12:57:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:45,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:45,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:57:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:45,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-07 12:57:45,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-07 12:57:45,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-07 12:57:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 12:57:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:45,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-07 12:57:45,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-07 12:57:45,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-07 12:57:45,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-07 12:57:45,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:57:45,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-07 12:57:45,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-07 12:57:45,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-07 12:57:45,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-07 12:57:45,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {39#true} is VALID [2022-04-07 12:57:45,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {39#true} is VALID [2022-04-07 12:57:45,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-07 12:57:45,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-07 12:57:45,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-07 12:57:45,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-07 12:57:45,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-07 12:57:45,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-07 12:57:45,595 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-07 12:57:45,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-07 12:57:45,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-07 12:57:45,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-07 12:57:45,596 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 12:57:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:45,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44241138] [2022-04-07 12:57:45,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44241138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:45,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:45,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:57:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096262976] [2022-04-07 12:57:45,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:57:45,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:45,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:45,644 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 12:57:45,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:57:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:57:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:57:45,672 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:45,884 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-07 12:57:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:57:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:57:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-07 12:57:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-07 12:57:45,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-07 12:57:46,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:46,028 INFO L225 Difference]: With dead ends: 63 [2022-04-07 12:57:46,029 INFO L226 Difference]: Without dead ends: 31 [2022-04-07 12:57:46,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:57:46,036 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:46,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:57:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-07 12:57:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-07 12:57:46,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:46,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,078 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,079 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:46,082 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-07 12:57:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-07 12:57:46,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:46,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:46,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-07 12:57:46,084 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-07 12:57:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:46,087 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-07 12:57:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-07 12:57:46,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:46,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:46,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:46,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-07 12:57:46,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-07 12:57:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:46,091 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-07 12:57:46,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-07 12:57:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:57:46,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:46,092 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:46,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:57:46,093 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-07 12:57:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:46,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054594048] [2022-04-07 12:57:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:57:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:46,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {258#true} is VALID [2022-04-07 12:57:46,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 12:57:46,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-07 12:57:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 12:57:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:46,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-07 12:57:46,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-07 12:57:46,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 12:57:46,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-07 12:57:46,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:57:46,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {258#true} is VALID [2022-04-07 12:57:46,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 12:57:46,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #84#return; {258#true} is VALID [2022-04-07 12:57:46,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret5 := main(); {258#true} is VALID [2022-04-07 12:57:46,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {258#true} is VALID [2022-04-07 12:57:46,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {258#true} is VALID [2022-04-07 12:57:46,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-04-07 12:57:46,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-04-07 12:57:46,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 12:57:46,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {258#true} {258#true} #60#return; {258#true} is VALID [2022-04-07 12:57:46,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:57:46,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:57:46,193 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:46,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:57:46,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {259#false} is VALID [2022-04-07 12:57:46,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-07 12:57:46,194 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 12:57:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054594048] [2022-04-07 12:57:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054594048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:46,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:46,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:57:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501491354] [2022-04-07 12:57:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:46,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:57:46,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:46,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:46,207 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 12:57:46,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:57:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:57:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:57:46,208 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:46,582 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-07 12:57:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:57:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-07 12:57:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-07 12:57:46,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-07 12:57:46,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:46,641 INFO L225 Difference]: With dead ends: 37 [2022-04-07 12:57:46,641 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 12:57:46,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:46,642 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:46,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:57:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 12:57:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-07 12:57:46,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:46,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,653 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,654 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:46,655 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-07 12:57:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-07 12:57:46,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:46,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:46,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-07 12:57:46,657 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-07 12:57:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:46,659 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-07 12:57:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-07 12:57:46,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:46,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:46,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:46,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:57:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-07 12:57:46,665 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-07 12:57:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:46,665 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-07 12:57:46,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:57:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-07 12:57:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 12:57:46,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:46,666 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:46,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:57:46,666 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-07 12:57:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:46,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039118302] [2022-04-07 12:57:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:46,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:46,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019901916] [2022-04-07 12:57:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:46,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:46,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:46,692 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 12:57:46,714 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 12:57:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:46,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:57:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:46,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:46,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2022-04-07 12:57:46,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#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(13, 2);call #Ultimate.allocInit(12, 3); {463#true} is VALID [2022-04-07 12:57:46,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-07 12:57:46,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #84#return; {463#true} is VALID [2022-04-07 12:57:46,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret5 := main(); {463#true} is VALID [2022-04-07 12:57:46,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {463#true} is VALID [2022-04-07 12:57:46,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {463#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {463#true} is VALID [2022-04-07 12:57:46,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-07 12:57:46,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-07 12:57:46,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-07 12:57:46,903 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {463#true} {463#true} #60#return; {463#true} is VALID [2022-04-07 12:57:46,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:46,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:46,904 INFO L272 TraceCheckUtils]: 13: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {463#true} is VALID [2022-04-07 12:57:46,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#true} ~cond := #in~cond; {463#true} is VALID [2022-04-07 12:57:46,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#true} assume !(0 == ~cond); {463#true} is VALID [2022-04-07 12:57:46,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-07 12:57:46,905 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {463#true} {501#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {501#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:46,906 INFO L272 TraceCheckUtils]: 18: Hoare triple {501#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:46,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:46,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {464#false} is VALID [2022-04-07 12:57:46,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#false} assume !false; {464#false} is VALID [2022-04-07 12:57:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:57:46,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:57:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:46,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039118302] [2022-04-07 12:57:46,907 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:46,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019901916] [2022-04-07 12:57:46,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019901916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:46,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:46,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:57:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210302586] [2022-04-07 12:57:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:46,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 12:57:46,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:46,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:57:46,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:46,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:57:46,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:57:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:57:46,923 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:57:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,111 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-07 12:57:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:57:47,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 12:57:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:57:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 12:57:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:57:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 12:57:47,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-07 12:57:47,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:47,178 INFO L225 Difference]: With dead ends: 54 [2022-04-07 12:57:47,178 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 12:57:47,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:57:47,185 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:47,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:57:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 12:57:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-07 12:57:47,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:47,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:57:47,202 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:57:47,204 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:57:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,213 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:57:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:57:47,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:47,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:47,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-07 12:57:47,216 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-07 12:57:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,218 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:57:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:57:47,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:47,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:47,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:47,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:57:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-07 12:57:47,221 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-07 12:57:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:47,221 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-07 12:57:47,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:57:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-07 12:57:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 12:57:47,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:47,222 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:47,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 12:57:47,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:47,441 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:47,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-07 12:57:47,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:47,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917697490] [2022-04-07 12:57:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:47,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:47,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115064003] [2022-04-07 12:57:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:47,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:47,456 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 12:57:47,457 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 12:57:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:47,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:57:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:47,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:47,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {792#true} call ULTIMATE.init(); {792#true} is VALID [2022-04-07 12:57:47,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {792#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(13, 2);call #Ultimate.allocInit(12, 3); {792#true} is VALID [2022-04-07 12:57:47,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-07 12:57:47,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {792#true} {792#true} #84#return; {792#true} is VALID [2022-04-07 12:57:47,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {792#true} call #t~ret5 := main(); {792#true} is VALID [2022-04-07 12:57:47,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {792#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {792#true} is VALID [2022-04-07 12:57:47,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {792#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {792#true} is VALID [2022-04-07 12:57:47,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-07 12:57:47,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-07 12:57:47,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-07 12:57:47,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {792#true} {792#true} #60#return; {792#true} is VALID [2022-04-07 12:57:47,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {792#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:57:47,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:57:47,620 INFO L272 TraceCheckUtils]: 13: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {792#true} is VALID [2022-04-07 12:57:47,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-07 12:57:47,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-07 12:57:47,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-07 12:57:47,626 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {792#true} {830#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:57:47,626 INFO L272 TraceCheckUtils]: 18: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {792#true} is VALID [2022-04-07 12:57:47,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {792#true} ~cond := #in~cond; {792#true} is VALID [2022-04-07 12:57:47,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {792#true} assume !(0 == ~cond); {792#true} is VALID [2022-04-07 12:57:47,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {792#true} assume true; {792#true} is VALID [2022-04-07 12:57:47,627 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {792#true} {830#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {830#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:57:47,628 INFO L272 TraceCheckUtils]: 23: Hoare triple {830#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:47,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:47,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {793#false} is VALID [2022-04-07 12:57:47,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {793#false} assume !false; {793#false} is VALID [2022-04-07 12:57:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:57:47,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:57:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:47,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917697490] [2022-04-07 12:57:47,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:47,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115064003] [2022-04-07 12:57:47,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115064003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:47,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:47,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:57:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194741215] [2022-04-07 12:57:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 12:57:47,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:47,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:57:47,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:47,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:57:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:47,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:57:47,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:57:47,653 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:57:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,892 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-07 12:57:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:57:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 12:57:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:57:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 12:57:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:57:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 12:57:47,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-07 12:57:47,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:47,948 INFO L225 Difference]: With dead ends: 58 [2022-04-07 12:57:47,948 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 12:57:47,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:57:47,949 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:47,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:57:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 12:57:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-07 12:57:47,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:47,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:57:47,956 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:57:47,957 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:57:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,959 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-07 12:57:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-07 12:57:47,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:47,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:47,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-07 12:57:47,960 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-07 12:57:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,962 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-07 12:57:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-07 12:57:47,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:47,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:47,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:47,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:57:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-07 12:57:47,965 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-07 12:57:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:47,965 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-07 12:57:47,965 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:57:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-07 12:57:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 12:57:47,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:47,966 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:47,984 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 12:57:48,181 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,SelfDestructingSolverStorable3 [2022-04-07 12:57:48,182 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-07 12:57:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:48,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379982324] [2022-04-07 12:57:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:48,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:48,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528400613] [2022-04-07 12:57:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:48,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:48,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:48,193 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 12:57:48,194 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 12:57:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:48,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 12:57:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:48,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:48,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1165#true} is VALID [2022-04-07 12:57:48,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#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(13, 2);call #Ultimate.allocInit(12, 3); {1165#true} is VALID [2022-04-07 12:57:48,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-07 12:57:48,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #84#return; {1165#true} is VALID [2022-04-07 12:57:48,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret5 := main(); {1165#true} is VALID [2022-04-07 12:57:48,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1165#true} is VALID [2022-04-07 12:57:48,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {1165#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1165#true} is VALID [2022-04-07 12:57:48,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-07 12:57:48,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-07 12:57:48,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-07 12:57:48,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1165#true} {1165#true} #60#return; {1165#true} is VALID [2022-04-07 12:57:48,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {1165#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:48,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:48,361 INFO L272 TraceCheckUtils]: 13: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1165#true} is VALID [2022-04-07 12:57:48,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-07 12:57:48,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-07 12:57:48,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-07 12:57:48,362 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:48,362 INFO L272 TraceCheckUtils]: 18: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1165#true} is VALID [2022-04-07 12:57:48,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-07 12:57:48,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-07 12:57:48,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-07 12:57:48,374 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:48,374 INFO L272 TraceCheckUtils]: 23: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1165#true} is VALID [2022-04-07 12:57:48,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#true} ~cond := #in~cond; {1165#true} is VALID [2022-04-07 12:57:48,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#true} assume !(0 == ~cond); {1165#true} is VALID [2022-04-07 12:57:48,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-07 12:57:48,379 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1165#true} {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:48,380 INFO L272 TraceCheckUtils]: 28: Hoare triple {1203#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:48,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:48,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {1259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1166#false} is VALID [2022-04-07 12:57:48,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-07 12:57:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 12:57:48,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:57:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379982324] [2022-04-07 12:57:48,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528400613] [2022-04-07 12:57:48,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528400613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:48,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:48,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:57:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713758869] [2022-04-07 12:57:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-07 12:57:48,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:48,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:57:48,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:48,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:57:48,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:48,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:57:48,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:57:48,397 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:57:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:48,596 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-07 12:57:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:57:48,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-07 12:57:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:57:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 12:57:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:57:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-07 12:57:48,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-07 12:57:48,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:48,651 INFO L225 Difference]: With dead ends: 66 [2022-04-07 12:57:48,651 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 12:57:48,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:57:48,652 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:48,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:57:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 12:57:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-07 12:57:48,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:48,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:48,659 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:48,660 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:48,661 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-07 12:57:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-07 12:57:48,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:48,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:48,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-07 12:57:48,662 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-07 12:57:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:48,666 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-07 12:57:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-07 12:57:48,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:48,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:48,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:48,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-07 12:57:48,668 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-07 12:57:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:48,668 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-07 12:57:48,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:57:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-07 12:57:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 12:57:48,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:48,669 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:48,693 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 12:57:48,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:48,885 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-07 12:57:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:48,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230334836] [2022-04-07 12:57:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:48,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:48,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652001836] [2022-04-07 12:57:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:48,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:48,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:48,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:48,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 12:57:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:48,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:57:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:48,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:49,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#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(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-07 12:57:49,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:49,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:49,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,130 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:49,130 INFO L272 TraceCheckUtils]: 18: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,131 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:49,131 INFO L272 TraceCheckUtils]: 23: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,132 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:49,132 INFO L272 TraceCheckUtils]: 28: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,133 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:49,133 INFO L272 TraceCheckUtils]: 33: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,134 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1560#true} {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:49,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {1598#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:49,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:49,134 INFO L272 TraceCheckUtils]: 40: Hoare triple {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,135 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1560#true} {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #62#return; {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:49,136 INFO L272 TraceCheckUtils]: 45: Hoare triple {1680#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:49,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:49,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-07 12:57:49,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-07 12:57:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:57:49,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:49,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-07 12:57:49,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {1706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1561#false} is VALID [2022-04-07 12:57:49,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:49,314 INFO L272 TraceCheckUtils]: 45: Hoare triple {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:49,316 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1560#true} {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:57:49,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,316 INFO L272 TraceCheckUtils]: 40: Hoare triple {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:57:49,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1722#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:57:49,323 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #70#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:57:49,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,323 INFO L272 TraceCheckUtils]: 33: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,324 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #68#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:57:49,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,324 INFO L272 TraceCheckUtils]: 28: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,325 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #66#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:57:49,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,326 INFO L272 TraceCheckUtils]: 23: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,326 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #64#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:57:49,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,326 INFO L272 TraceCheckUtils]: 18: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,327 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1560#true} {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #62#return; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:57:49,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,327 INFO L272 TraceCheckUtils]: 13: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !false; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:57:49,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1744#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:57:49,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1560#true} {1560#true} #60#return; {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume !(0 == ~cond); {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} ~cond := #in~cond; {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {1560#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret5 := main(); {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #84#return; {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-07 12:57:49,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#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(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-07 12:57:49,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-07 12:57:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:57:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230334836] [2022-04-07 12:57:49,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652001836] [2022-04-07 12:57:49,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652001836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:49,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:49,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:57:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647219663] [2022-04-07 12:57:49,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:49,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2022-04-07 12:57:49,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:49,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:57:49,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:49,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:49,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:57:49,372 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:57:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:50,196 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-07 12:57:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:50,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2022-04-07 12:57:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:57:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-07 12:57:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:57:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-07 12:57:50,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-07 12:57:50,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:50,312 INFO L225 Difference]: With dead ends: 77 [2022-04-07 12:57:50,312 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 12:57:50,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:57:50,313 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:50,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:57:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 12:57:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2022-04-07 12:57:50,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:50,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:50,327 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:50,327 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:50,329 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-07 12:57:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-07 12:57:50,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:50,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:50,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 75 states. [2022-04-07 12:57:50,330 INFO L87 Difference]: Start difference. First operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 75 states. [2022-04-07 12:57:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:50,332 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-04-07 12:57:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-07 12:57:50,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:50,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:50,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:50,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-04-07 12:57:50,334 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 49 [2022-04-07 12:57:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:50,335 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-04-07 12:57:50,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:57:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-07 12:57:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-07 12:57:50,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:50,335 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:50,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:50,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:50,551 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:50,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 2 times [2022-04-07 12:57:50,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:50,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135235219] [2022-04-07 12:57:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:50,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:50,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498030660] [2022-04-07 12:57:50,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:50,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:50,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 12:57:50,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:50,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:50,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:57:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:50,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:50,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-07 12:57:50,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#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(13, 2);call #Ultimate.allocInit(12, 3); {2230#true} is VALID [2022-04-07 12:57:50,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-07 12:57:50,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:50,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:50,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,815 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:50,815 INFO L272 TraceCheckUtils]: 18: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,816 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:50,816 INFO L272 TraceCheckUtils]: 23: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,817 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:50,817 INFO L272 TraceCheckUtils]: 28: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,817 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:50,817 INFO L272 TraceCheckUtils]: 33: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,818 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2230#true} {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:57:50,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {2268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:57:50,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:57:50,819 INFO L272 TraceCheckUtils]: 40: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,820 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2230#true} {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:57:50,820 INFO L272 TraceCheckUtils]: 45: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,820 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2230#true} {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:57:50,821 INFO L272 TraceCheckUtils]: 50: Hoare triple {2350#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:50,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-07 12:57:50,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-07 12:57:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 12:57:50,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:50,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-07 12:57:50,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2231#false} is VALID [2022-04-07 12:57:50,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,992 INFO L272 TraceCheckUtils]: 50: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:50,993 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2230#true} {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:57:50,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,993 INFO L272 TraceCheckUtils]: 45: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,994 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2230#true} {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:57:50,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,994 INFO L272 TraceCheckUtils]: 40: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:57:50,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2407#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:57:50,997 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:57:50,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,997 INFO L272 TraceCheckUtils]: 33: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,998 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:57:50,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,998 INFO L272 TraceCheckUtils]: 28: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,998 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:57:50,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,999 INFO L272 TraceCheckUtils]: 23: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:50,999 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:57:50,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:50,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:50,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:50,999 INFO L272 TraceCheckUtils]: 18: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:51,000 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2230#true} {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:57:51,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:51,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:51,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:51,000 INFO L272 TraceCheckUtils]: 13: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:51,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:57:51,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2444#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:57:51,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2230#true} {2230#true} #60#return; {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {2230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret5 := main(); {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #84#return; {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#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(13, 2);call #Ultimate.allocInit(12, 3); {2230#true} is VALID [2022-04-07 12:57:51,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-07 12:57:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 12:57:51,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:51,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135235219] [2022-04-07 12:57:51,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:51,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498030660] [2022-04-07 12:57:51,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498030660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:51,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:51,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:57:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752245345] [2022-04-07 12:57:51,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 54 [2022-04-07 12:57:51,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:51,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-07 12:57:51,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:51,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:57:51,043 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-07 12:57:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:51,651 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-07 12:57:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:57:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 54 [2022-04-07 12:57:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-07 12:57:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-07 12:57:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-07 12:57:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-07 12:57:51,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-07 12:57:51,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:51,717 INFO L225 Difference]: With dead ends: 81 [2022-04-07 12:57:51,717 INFO L226 Difference]: Without dead ends: 79 [2022-04-07 12:57:51,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:57:51,718 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:51,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 197 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:57:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-07 12:57:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-04-07 12:57:51,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:51,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 12:57:51,735 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 12:57:51,735 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 12:57:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:51,737 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-07 12:57:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-07 12:57:51,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:51,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:51,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-07 12:57:51,738 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-07 12:57:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:51,740 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-07 12:57:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-07 12:57:51,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:51,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:51,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:51,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 12:57:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-04-07 12:57:51,742 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 54 [2022-04-07 12:57:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:51,743 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-04-07 12:57:51,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-07 12:57:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-04-07 12:57:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-07 12:57:51,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:51,743 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:51,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:51,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:51,960 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 3 times [2022-04-07 12:57:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:51,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744982988] [2022-04-07 12:57:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:51,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:51,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771648252] [2022-04-07 12:57:51,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:57:51,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:51,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:51,969 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:51,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 12:57:51,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 12:57:51,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:51,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:57:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:52,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:52,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#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(13, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-07 12:57:52,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {2952#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:52,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:52,242 INFO L272 TraceCheckUtils]: 13: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,243 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:52,243 INFO L272 TraceCheckUtils]: 18: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,243 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:52,244 INFO L272 TraceCheckUtils]: 23: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,244 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:52,244 INFO L272 TraceCheckUtils]: 28: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,245 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:52,245 INFO L272 TraceCheckUtils]: 33: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,246 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2952#true} {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:52,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {2990#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-07 12:57:52,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} assume !false; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-07 12:57:52,252 INFO L272 TraceCheckUtils]: 40: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,252 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #62#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-07 12:57:52,253 INFO L272 TraceCheckUtils]: 45: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,254 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #64#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-07 12:57:52,254 INFO L272 TraceCheckUtils]: 50: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,254 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,254 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,255 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2952#true} {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} #66#return; {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} is VALID [2022-04-07 12:57:52,256 INFO L272 TraceCheckUtils]: 55: Hoare triple {3072#(and (= 7 main_~y~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:52,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:52,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-07 12:57:52,256 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-07 12:57:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 12:57:52,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:52,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {2953#false} assume !false; {2953#false} is VALID [2022-04-07 12:57:52,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2953#false} is VALID [2022-04-07 12:57:52,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:52,652 INFO L272 TraceCheckUtils]: 55: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:52,653 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:57:52,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,653 INFO L272 TraceCheckUtils]: 50: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,654 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:57:52,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,654 INFO L272 TraceCheckUtils]: 45: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,655 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2952#true} {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:57:52,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,655 INFO L272 TraceCheckUtils]: 40: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:57:52,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3144#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:57:52,659 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #70#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:57:52,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,659 INFO L272 TraceCheckUtils]: 33: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,659 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #68#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:57:52,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,660 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #66#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:57:52,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,660 INFO L272 TraceCheckUtils]: 23: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,661 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #64#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:57:52,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,661 INFO L272 TraceCheckUtils]: 18: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,661 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2952#true} {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #62#return; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:57:52,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,662 INFO L272 TraceCheckUtils]: 13: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !false; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:57:52,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {2952#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3196#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:57:52,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2952#true} {2952#true} #60#return; {2952#true} is VALID [2022-04-07 12:57:52,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} assume !(0 == ~cond); {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} ~cond := #in~cond; {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {2952#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} call #t~ret5 := main(); {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} #84#return; {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} assume true; {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#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(13, 2);call #Ultimate.allocInit(12, 3); {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} call ULTIMATE.init(); {2952#true} is VALID [2022-04-07 12:57:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 12:57:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744982988] [2022-04-07 12:57:52,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771648252] [2022-04-07 12:57:52,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771648252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:52,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:52,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:57:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392662407] [2022-04-07 12:57:52,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 59 [2022-04-07 12:57:52,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:52,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:52,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:52,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:52,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:57:52,713 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:55,132 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-07 12:57:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:55,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 59 [2022-04-07 12:57:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-07 12:57:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-07 12:57:55,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-07 12:57:57,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:57,232 INFO L225 Difference]: With dead ends: 93 [2022-04-07 12:57:57,233 INFO L226 Difference]: Without dead ends: 85 [2022-04-07 12:57:57,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:57,233 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:57,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:57:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-07 12:57:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-04-07 12:57:57,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:57,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:57,251 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:57,252 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:57,254 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-07 12:57:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-07 12:57:57,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:57,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:57,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 85 states. [2022-04-07 12:57:57,255 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 85 states. [2022-04-07 12:57:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:57,257 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-04-07 12:57:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-04-07 12:57:57,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:57,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:57,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:57,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 19 states have call successors, (19), 14 states have call predecessors, (19), 13 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:57:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-07 12:57:57,259 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 59 [2022-04-07 12:57:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:57,259 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-07 12:57:57,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-07 12:57:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 12:57:57,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:57,260 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:57,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-07 12:57:57,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:57,476 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-07 12:57:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:57,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420379949] [2022-04-07 12:57:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:57,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:57,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697847137] [2022-04-07 12:57:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:57,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:57,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:57,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:57,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 12:57:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:57,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 12:57:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:57,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:57,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {3742#true} call ULTIMATE.init(); {3742#true} is VALID [2022-04-07 12:57:57,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {3742#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(13, 2);call #Ultimate.allocInit(12, 3); {3742#true} is VALID [2022-04-07 12:57:57,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:57,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3742#true} {3742#true} #84#return; {3742#true} is VALID [2022-04-07 12:57:57,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {3742#true} call #t~ret5 := main(); {3742#true} is VALID [2022-04-07 12:57:57,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {3742#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {3742#true} is VALID [2022-04-07 12:57:57,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {3742#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,000 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3742#true} {3742#true} #60#return; {3742#true} is VALID [2022-04-07 12:57:58,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {3742#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:58,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:58,000 INFO L272 TraceCheckUtils]: 13: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,001 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:58,001 INFO L272 TraceCheckUtils]: 18: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,002 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:58,002 INFO L272 TraceCheckUtils]: 23: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,002 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:58,002 INFO L272 TraceCheckUtils]: 28: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,003 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:58,003 INFO L272 TraceCheckUtils]: 33: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,004 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3742#true} {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:58,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {3780#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:58,004 INFO L290 TraceCheckUtils]: 39: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:58,004 INFO L272 TraceCheckUtils]: 40: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,005 INFO L290 TraceCheckUtils]: 43: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,005 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:58,006 INFO L272 TraceCheckUtils]: 45: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,006 INFO L290 TraceCheckUtils]: 47: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,006 INFO L290 TraceCheckUtils]: 48: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,008 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:58,008 INFO L272 TraceCheckUtils]: 50: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,009 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:58,009 INFO L272 TraceCheckUtils]: 55: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,009 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:58,009 INFO L272 TraceCheckUtils]: 60: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,010 INFO L290 TraceCheckUtils]: 63: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,010 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3742#true} {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:58,011 INFO L290 TraceCheckUtils]: 65: Hoare triple {3862#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:57:58,011 INFO L272 TraceCheckUtils]: 66: Hoare triple {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3742#true} is VALID [2022-04-07 12:57:58,011 INFO L290 TraceCheckUtils]: 67: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-04-07 12:57:58,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-04-07 12:57:58,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-04-07 12:57:58,011 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3742#true} {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:57:58,012 INFO L272 TraceCheckUtils]: 71: Hoare triple {3944#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {3963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:58,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {3963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:58,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {3967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3743#false} is VALID [2022-04-07 12:57:58,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {3743#false} assume !false; {3743#false} is VALID [2022-04-07 12:57:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-07 12:57:58,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:58,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420379949] [2022-04-07 12:57:58,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:58,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697847137] [2022-04-07 12:57:58,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697847137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:58,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:58,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 12:57:58,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250256407] [2022-04-07 12:57:58,377 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:58,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-07 12:57:58,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:58,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:58,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:58,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 12:57:58,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:58,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 12:57:58,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:58,412 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:58,831 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-04-07 12:57:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:58,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-07 12:57:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-07 12:57:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-07 12:57:58,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-07 12:57:58,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:58,890 INFO L225 Difference]: With dead ends: 95 [2022-04-07 12:57:58,890 INFO L226 Difference]: Without dead ends: 93 [2022-04-07 12:57:58,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:57:58,890 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:58,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:57:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-07 12:57:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-04-07 12:57:58,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:58,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 12:57:58,917 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 12:57:58,917 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 12:57:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:58,919 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-07 12:57:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-07 12:57:58,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:58,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:58,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 93 states. [2022-04-07 12:57:58,920 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 93 states. [2022-04-07 12:57:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:58,922 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-07 12:57:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-07 12:57:58,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:58,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:58,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:58,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 23 states have call successors, (23), 16 states have call predecessors, (23), 15 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 12:57:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-04-07 12:57:58,925 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 75 [2022-04-07 12:57:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:58,926 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-04-07 12:57:58,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-07 12:57:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-07 12:57:58,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:58,926 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:58,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-07 12:57:59,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:59,139 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-07 12:57:59,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:59,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608395087] [2022-04-07 12:57:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:59,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:59,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:59,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757881593] [2022-04-07 12:57:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:59,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:59,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:59,149 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:59,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 12:57:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:59,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 12:57:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:59,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:00,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {4552#true} call ULTIMATE.init(); {4552#true} is VALID [2022-04-07 12:58:00,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {4552#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(13, 2);call #Ultimate.allocInit(12, 3); {4552#true} is VALID [2022-04-07 12:58:00,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4552#true} {4552#true} #84#return; {4552#true} is VALID [2022-04-07 12:58:00,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {4552#true} call #t~ret5 := main(); {4552#true} is VALID [2022-04-07 12:58:00,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {4552#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {4572#(or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-07 12:58:00,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {4572#(or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {4552#true} ~cond := #in~cond; {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:58:00,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:58:00,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:58:00,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} {4572#(or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} #60#return; {4590#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {4590#(and (<= 0 main_~a~0) (<= main_~a~0 10))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} assume !false; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,954 INFO L272 TraceCheckUtils]: 13: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,954 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} #62#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,954 INFO L272 TraceCheckUtils]: 18: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,955 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} #64#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,955 INFO L272 TraceCheckUtils]: 23: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,956 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} #66#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,956 INFO L272 TraceCheckUtils]: 28: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,957 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} #68#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,957 INFO L272 TraceCheckUtils]: 33: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,957 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4552#true} {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} #70#return; {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {4594#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (<= 0 main_~a~0) (<= 6 main_~z~0) (<= main_~a~0 10))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} assume !false; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,959 INFO L272 TraceCheckUtils]: 40: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,959 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} #62#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,959 INFO L272 TraceCheckUtils]: 45: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,960 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} #64#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,960 INFO L272 TraceCheckUtils]: 50: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,960 INFO L290 TraceCheckUtils]: 53: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,961 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} #66#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,961 INFO L272 TraceCheckUtils]: 55: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,961 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4552#true} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} #68#return; {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,961 INFO L272 TraceCheckUtils]: 60: Hoare triple {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:00,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:00,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:00,963 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} {4676#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} #70#return; {4757#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:00,963 INFO L290 TraceCheckUtils]: 65: Hoare triple {4757#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1) (<= main_~a~0 10))} assume !(~n~0 <= ~a~0); {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:58:00,963 INFO L272 TraceCheckUtils]: 66: Hoare triple {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {4552#true} ~cond := #in~cond; {4552#true} is VALID [2022-04-07 12:58:00,964 INFO L290 TraceCheckUtils]: 68: Hoare triple {4552#true} assume !(0 == ~cond); {4552#true} is VALID [2022-04-07 12:58:00,964 INFO L290 TraceCheckUtils]: 69: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-07 12:58:00,964 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4552#true} {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:58:00,964 INFO L272 TraceCheckUtils]: 71: Hoare triple {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4552#true} is VALID [2022-04-07 12:58:00,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {4552#true} ~cond := #in~cond; {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:00,965 INFO L290 TraceCheckUtils]: 73: Hoare triple {4746#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:00,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:00,966 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {4750#(not (= |__VERIFIER_assert_#in~cond| 0))} {4761#(and (<= (+ main_~x~0 6) main_~y~0) (<= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #74#return; {4792#(and (<= 7 main_~y~0) (<= (+ 5 main_~y~0) main_~z~0) (< main_~a~0 1) (= main_~z~0 (+ (* main_~a~0 6) 12)))} is VALID [2022-04-07 12:58:00,967 INFO L272 TraceCheckUtils]: 76: Hoare triple {4792#(and (<= 7 main_~y~0) (<= (+ 5 main_~y~0) main_~z~0) (< main_~a~0 1) (= main_~z~0 (+ (* main_~a~0 6) 12)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {4796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:00,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {4796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:00,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {4800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4553#false} is VALID [2022-04-07 12:58:00,967 INFO L290 TraceCheckUtils]: 79: Hoare triple {4553#false} assume !false; {4553#false} is VALID [2022-04-07 12:58:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 79 proven. 12 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-07 12:58:00,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608395087] [2022-04-07 12:58:36,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757881593] [2022-04-07 12:58:36,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757881593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:58:36,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:58:36,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-07 12:58:36,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187115517] [2022-04-07 12:58:36,468 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 80 [2022-04-07 12:58:36,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:36,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:58:36,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:36,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 12:58:36,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 12:58:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:58:36,515 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:58:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:37,768 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-04-07 12:58:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 12:58:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 80 [2022-04-07 12:58:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:58:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-07 12:58:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:58:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-07 12:58:37,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-07 12:58:37,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:37,837 INFO L225 Difference]: With dead ends: 103 [2022-04-07 12:58:37,837 INFO L226 Difference]: Without dead ends: 90 [2022-04-07 12:58:37,838 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-04-07 12:58:37,838 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:37,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:58:37,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-07 12:58:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-07 12:58:37,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:37,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:37,884 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:37,885 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:37,886 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-07 12:58:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-07 12:58:37,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:37,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:37,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-07 12:58:37,887 INFO L87 Difference]: Start difference. First operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-07 12:58:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:37,888 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-07 12:58:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-07 12:58:37,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:37,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:37,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:37,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-04-07 12:58:37,890 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 80 [2022-04-07 12:58:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:37,890 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-04-07 12:58:37,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-07 12:58:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-04-07 12:58:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-07 12:58:37,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:37,891 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:37,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:38,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 12:58:38,112 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:38,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 4 times [2022-04-07 12:58:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:38,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889606600] [2022-04-07 12:58:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:38,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:38,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967501538] [2022-04-07 12:58:38,121 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:58:38,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:38,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:38,122 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:38,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 12:58:38,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:58:38,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:38,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 12:58:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:38,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:38,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {5407#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(13, 2);call #Ultimate.allocInit(12, 3); {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {5407#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-07 12:58:38,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:38,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:38,488 INFO L272 TraceCheckUtils]: 13: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,488 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:38,488 INFO L272 TraceCheckUtils]: 18: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,489 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:38,489 INFO L272 TraceCheckUtils]: 23: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:38,490 INFO L272 TraceCheckUtils]: 28: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:38,490 INFO L272 TraceCheckUtils]: 33: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,491 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5407#true} {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:38,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {5445#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-07 12:58:38,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-07 12:58:38,492 INFO L272 TraceCheckUtils]: 40: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,492 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-07 12:58:38,492 INFO L272 TraceCheckUtils]: 45: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,493 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-07 12:58:38,493 INFO L272 TraceCheckUtils]: 50: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,493 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-07 12:58:38,494 INFO L272 TraceCheckUtils]: 55: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-07 12:58:38,494 INFO L272 TraceCheckUtils]: 60: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,494 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,495 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5407#true} {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-07 12:58:38,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {5527#(and (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-07 12:58:38,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} assume !false; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-07 12:58:38,495 INFO L272 TraceCheckUtils]: 67: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,496 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5407#true} {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #62#return; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-07 12:58:38,496 INFO L272 TraceCheckUtils]: 72: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,496 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,496 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {5407#true} {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #64#return; {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-07 12:58:38,497 INFO L272 TraceCheckUtils]: 77: Hoare triple {5609#(and (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:38,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:38,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-07 12:58:38,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-07 12:58:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-07 12:58:38,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:38,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {5408#false} assume !false; {5408#false} is VALID [2022-04-07 12:58:38,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {5650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5408#false} is VALID [2022-04-07 12:58:38,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:38,740 INFO L272 TraceCheckUtils]: 77: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:38,741 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {5407#true} {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:58:38,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,741 INFO L272 TraceCheckUtils]: 72: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,741 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5407#true} {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:58:38,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,741 INFO L272 TraceCheckUtils]: 67: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,742 INFO L290 TraceCheckUtils]: 66: Hoare triple {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:58:38,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5666#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:58:38,744 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:58:38,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,744 INFO L272 TraceCheckUtils]: 60: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:58:38,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L272 TraceCheckUtils]: 55: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:58:38,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L290 TraceCheckUtils]: 51: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,745 INFO L272 TraceCheckUtils]: 50: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:58:38,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L272 TraceCheckUtils]: 45: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5407#true} {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:58:38,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,746 INFO L272 TraceCheckUtils]: 40: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:58:38,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5703#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:58:38,749 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-07 12:58:38,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,750 INFO L272 TraceCheckUtils]: 33: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,750 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-07 12:58:38,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,750 INFO L272 TraceCheckUtils]: 28: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-07 12:58:38,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L272 TraceCheckUtils]: 23: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-07 12:58:38,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,751 INFO L272 TraceCheckUtils]: 18: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,752 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5407#true} {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-07 12:58:38,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,752 INFO L272 TraceCheckUtils]: 13: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-07 12:58:38,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5785#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-07 12:58:38,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5407#true} {5407#true} #60#return; {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {5407#true} assume !(0 == ~cond); {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {5407#true} ~cond := #in~cond; {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {5407#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {5407#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {5407#true} call #t~ret5 := main(); {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5407#true} {5407#true} #84#return; {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {5407#true} assume true; {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {5407#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(13, 2);call #Ultimate.allocInit(12, 3); {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {5407#true} call ULTIMATE.init(); {5407#true} is VALID [2022-04-07 12:58:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-07 12:58:38,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889606600] [2022-04-07 12:58:38,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967501538] [2022-04-07 12:58:38,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967501538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:58:38,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:58:38,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 12:58:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4257991] [2022-04-07 12:58:38,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:38,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 81 [2022-04-07 12:58:38,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:38,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-07 12:58:38,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:38,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 12:58:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 12:58:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:58:38,820 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-07 12:58:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:39,790 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-04-07 12:58:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:58:39,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 81 [2022-04-07 12:58:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-07 12:58:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-07 12:58:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-07 12:58:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-07 12:58:39,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-07 12:58:39,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:39,914 INFO L225 Difference]: With dead ends: 106 [2022-04-07 12:58:39,914 INFO L226 Difference]: Without dead ends: 104 [2022-04-07 12:58:39,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:58:39,915 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:39,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:58:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-07 12:58:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-04-07 12:58:39,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:39,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:39,963 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:39,963 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:39,965 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-07 12:58:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-07 12:58:39,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:39,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:39,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 104 states. [2022-04-07 12:58:39,966 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 104 states. [2022-04-07 12:58:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:39,967 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-04-07 12:58:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-04-07 12:58:39,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:39,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:39,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:39,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 12:58:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-04-07 12:58:39,969 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 81 [2022-04-07 12:58:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:39,969 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-04-07 12:58:39,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-04-07 12:58:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-07 12:58:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-07 12:58:39,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:39,970 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:39,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:40,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:40,183 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 2 times [2022-04-07 12:58:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:40,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181949185] [2022-04-07 12:58:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:40,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:40,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662678188] [2022-04-07 12:58:40,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:58:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:40,194 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:40,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-07 12:58:40,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:58:40,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:40,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-07 12:58:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:40,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:40,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-07 12:58:40,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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(13, 2);call #Ultimate.allocInit(12, 3); {6409#true} is VALID [2022-04-07 12:58:40,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #84#return; {6409#true} is VALID [2022-04-07 12:58:40,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret5 := main(); {6409#true} is VALID [2022-04-07 12:58:40,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {6409#true} is VALID [2022-04-07 12:58:40,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #60#return; {6409#true} is VALID [2022-04-07 12:58:40,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:40,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:40,788 INFO L272 TraceCheckUtils]: 13: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,789 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:40,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,789 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:40,790 INFO L272 TraceCheckUtils]: 23: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,790 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:40,790 INFO L272 TraceCheckUtils]: 28: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,791 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:40,791 INFO L272 TraceCheckUtils]: 33: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,791 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6409#true} {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:40,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {6447#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:58:40,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:58:40,792 INFO L272 TraceCheckUtils]: 40: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:58:40,793 INFO L272 TraceCheckUtils]: 45: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:58:40,793 INFO L272 TraceCheckUtils]: 50: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,794 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #66#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:58:40,794 INFO L272 TraceCheckUtils]: 55: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,794 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #68#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:58:40,794 INFO L272 TraceCheckUtils]: 60: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,795 INFO L290 TraceCheckUtils]: 62: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,803 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6409#true} {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #70#return; {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-07 12:58:40,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {6529#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-07 12:58:40,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !false; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-07 12:58:40,804 INFO L272 TraceCheckUtils]: 67: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,805 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #62#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-07 12:58:40,805 INFO L272 TraceCheckUtils]: 72: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,805 INFO L290 TraceCheckUtils]: 75: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,806 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #64#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-07 12:58:40,806 INFO L272 TraceCheckUtils]: 77: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,806 INFO L290 TraceCheckUtils]: 80: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,807 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #66#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-07 12:58:40,807 INFO L272 TraceCheckUtils]: 82: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,807 INFO L290 TraceCheckUtils]: 83: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,807 INFO L290 TraceCheckUtils]: 84: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,807 INFO L290 TraceCheckUtils]: 85: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,807 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #68#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-07 12:58:40,808 INFO L272 TraceCheckUtils]: 87: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,808 INFO L290 TraceCheckUtils]: 88: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,808 INFO L290 TraceCheckUtils]: 89: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,808 INFO L290 TraceCheckUtils]: 90: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,808 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {6409#true} {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #70#return; {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-07 12:58:40,809 INFO L290 TraceCheckUtils]: 92: Hoare triple {6611#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-07 12:58:40,809 INFO L272 TraceCheckUtils]: 93: Hoare triple {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6409#true} is VALID [2022-04-07 12:58:40,809 INFO L290 TraceCheckUtils]: 94: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-07 12:58:40,809 INFO L290 TraceCheckUtils]: 95: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-07 12:58:40,809 INFO L290 TraceCheckUtils]: 96: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-07 12:58:40,810 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {6409#true} {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #72#return; {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-07 12:58:40,810 INFO L272 TraceCheckUtils]: 98: Hoare triple {6693#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:40,811 INFO L290 TraceCheckUtils]: 99: Hoare triple {6712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:40,811 INFO L290 TraceCheckUtils]: 100: Hoare triple {6716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-07 12:58:40,811 INFO L290 TraceCheckUtils]: 101: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-07 12:58:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-07 12:58:40,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181949185] [2022-04-07 12:58:41,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662678188] [2022-04-07 12:58:41,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662678188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:58:41,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:58:41,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 12:58:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539606162] [2022-04-07 12:58:41,158 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-07 12:58:41,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:41,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:58:41,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:41,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:58:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:58:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:58:41,205 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:58:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:41,873 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-04-07 12:58:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:58:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-07 12:58:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:58:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-07 12:58:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:58:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-07 12:58:41,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-07 12:58:41,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:41,949 INFO L225 Difference]: With dead ends: 118 [2022-04-07 12:58:41,949 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 12:58:41,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:58:41,950 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:41,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:58:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 12:58:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-07 12:58:42,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:42,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 12:58:42,017 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 12:58:42,017 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 12:58:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:42,019 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-07 12:58:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-07 12:58:42,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:42,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:42,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 116 states. [2022-04-07 12:58:42,020 INFO L87 Difference]: Start difference. First operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 116 states. [2022-04-07 12:58:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:42,021 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-04-07 12:58:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-04-07 12:58:42,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:42,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:42,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:42,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 12:58:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-04-07 12:58:42,024 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 102 [2022-04-07 12:58:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:42,024 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-04-07 12:58:42,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:58:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-04-07 12:58:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-07 12:58:42,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:42,025 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:42,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:42,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 12:58:42,243 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:42,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 2 times [2022-04-07 12:58:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:42,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588743388] [2022-04-07 12:58:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:42,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:42,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081238127] [2022-04-07 12:58:42,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:58:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:42,253 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:42,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-07 12:58:42,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:58:42,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:42,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-07 12:58:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:42,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:42,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {7413#true} call ULTIMATE.init(); {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {7413#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(13, 2);call #Ultimate.allocInit(12, 3); {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7413#true} {7413#true} #84#return; {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {7413#true} call #t~ret5 := main(); {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {7413#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {7413#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7413#true} {7413#true} #60#return; {7413#true} is VALID [2022-04-07 12:58:42,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {7413#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:42,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:42,883 INFO L272 TraceCheckUtils]: 13: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,883 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:42,883 INFO L272 TraceCheckUtils]: 18: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,884 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:42,884 INFO L272 TraceCheckUtils]: 23: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,884 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:42,885 INFO L272 TraceCheckUtils]: 28: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,885 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:42,885 INFO L272 TraceCheckUtils]: 33: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,886 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7413#true} {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:42,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {7451#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:58:42,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} assume !false; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:58:42,886 INFO L272 TraceCheckUtils]: 40: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,887 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #62#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:58:42,887 INFO L272 TraceCheckUtils]: 45: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,903 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #64#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:58:42,903 INFO L272 TraceCheckUtils]: 50: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,903 INFO L290 TraceCheckUtils]: 51: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,904 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #66#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:58:42,904 INFO L272 TraceCheckUtils]: 55: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,905 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #68#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:58:42,905 INFO L272 TraceCheckUtils]: 60: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,905 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7413#true} {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} #70#return; {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:58:42,906 INFO L290 TraceCheckUtils]: 65: Hoare triple {7533#(and (= main_~z~0 12) (= main_~n~0 1) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} assume !false; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,906 INFO L272 TraceCheckUtils]: 67: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,907 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #62#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,907 INFO L272 TraceCheckUtils]: 72: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #64#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,908 INFO L272 TraceCheckUtils]: 77: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #66#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,908 INFO L272 TraceCheckUtils]: 82: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,908 INFO L290 TraceCheckUtils]: 85: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,909 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #68#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,909 INFO L272 TraceCheckUtils]: 87: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,909 INFO L290 TraceCheckUtils]: 89: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,909 INFO L290 TraceCheckUtils]: 90: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,909 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {7413#true} {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #70#return; {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,910 INFO L290 TraceCheckUtils]: 92: Hoare triple {7615#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} assume !(~n~0 <= ~a~0); {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,910 INFO L272 TraceCheckUtils]: 93: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,910 INFO L290 TraceCheckUtils]: 94: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,910 INFO L290 TraceCheckUtils]: 95: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,910 INFO L290 TraceCheckUtils]: 96: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,911 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {7413#true} {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} #72#return; {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,911 INFO L272 TraceCheckUtils]: 98: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7413#true} is VALID [2022-04-07 12:58:42,911 INFO L290 TraceCheckUtils]: 99: Hoare triple {7413#true} ~cond := #in~cond; {7413#true} is VALID [2022-04-07 12:58:42,911 INFO L290 TraceCheckUtils]: 100: Hoare triple {7413#true} assume !(0 == ~cond); {7413#true} is VALID [2022-04-07 12:58:42,911 INFO L290 TraceCheckUtils]: 101: Hoare triple {7413#true} assume true; {7413#true} is VALID [2022-04-07 12:58:42,911 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {7413#true} {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} #74#return; {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:58:42,912 INFO L272 TraceCheckUtils]: 103: Hoare triple {7697#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {7731#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:42,912 INFO L290 TraceCheckUtils]: 104: Hoare triple {7731#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7735#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:42,912 INFO L290 TraceCheckUtils]: 105: Hoare triple {7735#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7414#false} is VALID [2022-04-07 12:58:42,912 INFO L290 TraceCheckUtils]: 106: Hoare triple {7414#false} assume !false; {7414#false} is VALID [2022-04-07 12:58:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-07 12:58:42,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:46,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:46,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588743388] [2022-04-07 12:58:46,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:46,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081238127] [2022-04-07 12:58:46,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081238127] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:58:46,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:58:46,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 12:58:46,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436850926] [2022-04-07 12:58:46,925 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-07 12:58:46,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:46,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-07 12:58:46,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:46,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:58:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:46,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:58:46,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:58:46,973 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-07 12:58:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:47,556 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2022-04-07 12:58:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:58:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-07 12:58:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-07 12:58:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-07 12:58:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-07 12:58:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-07 12:58:47,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-07 12:58:47,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:47,631 INFO L225 Difference]: With dead ends: 126 [2022-04-07 12:58:47,631 INFO L226 Difference]: Without dead ends: 113 [2022-04-07 12:58:47,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:58:47,632 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:47,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 207 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:58:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-07 12:58:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-07 12:58:47,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:47,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:47,694 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:47,694 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:47,696 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-07 12:58:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-07 12:58:47,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:47,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:47,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 113 states. [2022-04-07 12:58:47,696 INFO L87 Difference]: Start difference. First operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 113 states. [2022-04-07 12:58:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:47,698 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-04-07 12:58:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-07 12:58:47,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:47,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:47,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:47,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 26 states have call successors, (26), 20 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-04-07 12:58:47,700 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 107 [2022-04-07 12:58:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:47,700 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-04-07 12:58:47,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-07 12:58:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-04-07 12:58:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-07 12:58:47,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:47,703 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:47,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:47,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 12:58:47,915 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 3 times [2022-04-07 12:58:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:47,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714076443] [2022-04-07 12:58:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:47,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:47,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562195108] [2022-04-07 12:58:47,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:58:47,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:47,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:47,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:47,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-07 12:58:48,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-07 12:58:48,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:48,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:58:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:48,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:49,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-07 12:58:49,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#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(13, 2);call #Ultimate.allocInit(12, 3); {8447#true} is VALID [2022-04-07 12:58:49,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #84#return; {8447#true} is VALID [2022-04-07 12:58:49,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret5 := main(); {8447#true} is VALID [2022-04-07 12:58:49,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {8447#true} is VALID [2022-04-07 12:58:49,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {8447#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {8447#true} ~cond := #in~cond; {8473#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:58:49,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {8473#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8477#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:58:49,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {8477#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8477#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:58:49,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8477#(not (= |assume_abort_if_not_#in~cond| 0))} {8447#true} #60#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,597 INFO L272 TraceCheckUtils]: 13: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,597 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,598 INFO L272 TraceCheckUtils]: 18: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,598 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,598 INFO L272 TraceCheckUtils]: 23: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,599 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,599 INFO L272 TraceCheckUtils]: 28: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,599 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,599 INFO L272 TraceCheckUtils]: 33: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,600 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,601 INFO L272 TraceCheckUtils]: 40: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,601 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,601 INFO L272 TraceCheckUtils]: 45: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,602 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,602 INFO L272 TraceCheckUtils]: 50: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,602 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,602 INFO L272 TraceCheckUtils]: 55: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,603 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,603 INFO L272 TraceCheckUtils]: 60: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,603 INFO L290 TraceCheckUtils]: 63: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,604 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,604 INFO L272 TraceCheckUtils]: 67: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,605 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,605 INFO L272 TraceCheckUtils]: 72: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,605 INFO L290 TraceCheckUtils]: 73: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,606 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,606 INFO L272 TraceCheckUtils]: 77: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,606 INFO L290 TraceCheckUtils]: 78: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,606 INFO L290 TraceCheckUtils]: 79: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,606 INFO L290 TraceCheckUtils]: 80: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,606 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,607 INFO L272 TraceCheckUtils]: 82: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,607 INFO L290 TraceCheckUtils]: 83: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,607 INFO L290 TraceCheckUtils]: 84: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,607 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,607 INFO L272 TraceCheckUtils]: 87: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,607 INFO L290 TraceCheckUtils]: 88: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,607 INFO L290 TraceCheckUtils]: 89: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,607 INFO L290 TraceCheckUtils]: 90: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,608 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {8447#true} {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,609 INFO L290 TraceCheckUtils]: 92: Hoare triple {8484#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,609 INFO L290 TraceCheckUtils]: 93: Hoare triple {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,609 INFO L272 TraceCheckUtils]: 94: Hoare triple {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,609 INFO L290 TraceCheckUtils]: 95: Hoare triple {8447#true} ~cond := #in~cond; {8741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:49,610 INFO L290 TraceCheckUtils]: 96: Hoare triple {8741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:49,610 INFO L290 TraceCheckUtils]: 97: Hoare triple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:49,610 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {8745#(not (= |__VERIFIER_assert_#in~cond| 0))} {8731#(and (<= main_~n~0 (+ main_~a~0 1)) (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,611 INFO L272 TraceCheckUtils]: 99: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,611 INFO L290 TraceCheckUtils]: 100: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,611 INFO L290 TraceCheckUtils]: 101: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,611 INFO L290 TraceCheckUtils]: 102: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,611 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,611 INFO L272 TraceCheckUtils]: 104: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,611 INFO L290 TraceCheckUtils]: 105: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,611 INFO L290 TraceCheckUtils]: 106: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,611 INFO L290 TraceCheckUtils]: 107: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,612 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,612 INFO L272 TraceCheckUtils]: 109: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,612 INFO L290 TraceCheckUtils]: 110: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,612 INFO L290 TraceCheckUtils]: 111: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,612 INFO L290 TraceCheckUtils]: 112: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,613 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,613 INFO L272 TraceCheckUtils]: 114: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,613 INFO L290 TraceCheckUtils]: 115: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,613 INFO L290 TraceCheckUtils]: 116: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,613 INFO L290 TraceCheckUtils]: 117: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,613 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {8447#true} {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:58:49,614 INFO L290 TraceCheckUtils]: 119: Hoare triple {8752#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !(~n~0 <= ~a~0); {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:58:49,614 INFO L272 TraceCheckUtils]: 120: Hoare triple {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8447#true} is VALID [2022-04-07 12:58:49,614 INFO L290 TraceCheckUtils]: 121: Hoare triple {8447#true} ~cond := #in~cond; {8447#true} is VALID [2022-04-07 12:58:49,614 INFO L290 TraceCheckUtils]: 122: Hoare triple {8447#true} assume !(0 == ~cond); {8447#true} is VALID [2022-04-07 12:58:49,614 INFO L290 TraceCheckUtils]: 123: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-07 12:58:49,615 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {8447#true} {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} #72#return; {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:58:49,628 INFO L272 TraceCheckUtils]: 125: Hoare triple {8816#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= main_~a~0 10) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8835#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:49,629 INFO L290 TraceCheckUtils]: 126: Hoare triple {8835#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8839#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:49,629 INFO L290 TraceCheckUtils]: 127: Hoare triple {8839#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8448#false} is VALID [2022-04-07 12:58:49,629 INFO L290 TraceCheckUtils]: 128: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-07 12:58:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-07 12:58:49,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714076443] [2022-04-07 12:58:49,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562195108] [2022-04-07 12:58:49,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562195108] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:58:49,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:58:49,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-07 12:58:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973506946] [2022-04-07 12:58:49,712 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:49,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-07 12:58:49,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:49,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:58:49,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:49,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 12:58:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:49,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 12:58:49,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:58:49,767 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:58:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:50,466 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-04-07 12:58:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 12:58:50,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-07 12:58:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:58:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-04-07 12:58:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:58:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-04-07 12:58:50,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2022-04-07 12:58:50,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:50,512 INFO L225 Difference]: With dead ends: 119 [2022-04-07 12:58:50,512 INFO L226 Difference]: Without dead ends: 115 [2022-04-07 12:58:50,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:58:50,513 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:50,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:58:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-07 12:58:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-07 12:58:50,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:50,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:50,604 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:50,604 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:50,605 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-07 12:58:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-07 12:58:50,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:50,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:50,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-07 12:58:50,606 INFO L87 Difference]: Start difference. First operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 115 states. [2022-04-07 12:58:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:50,608 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-07 12:58:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-07 12:58:50,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:50,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:50,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:50,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 26 states have call successors, (26), 21 states have call predecessors, (26), 19 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 12:58:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2022-04-07 12:58:50,610 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 129 [2022-04-07 12:58:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:50,610 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2022-04-07 12:58:50,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:58:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-07 12:58:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-07 12:58:50,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:50,611 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:50,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-07 12:58:50,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 12:58:50,815 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:50,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 3 times [2022-04-07 12:58:50,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:50,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819695335] [2022-04-07 12:58:50,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:50,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:50,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711690111] [2022-04-07 12:58:50,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:58:50,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:50,828 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:50,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-07 12:58:50,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 12:58:50,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:50,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-07 12:58:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:50,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:59:10,112 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 12:59:14,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2022-04-07 12:59:14,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {9435#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(13, 2);call #Ultimate.allocInit(12, 3); {9435#true} is VALID [2022-04-07 12:59:14,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9435#true} {9435#true} #84#return; {9435#true} is VALID [2022-04-07 12:59:14,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret5 := main(); {9435#true} is VALID [2022-04-07 12:59:14,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {9435#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {9455#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-07 12:59:14,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {9455#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {9435#true} ~cond := #in~cond; {9462#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:59:14,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {9462#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9466#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:59:14,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {9466#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9466#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:59:14,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9466#(not (= |assume_abort_if_not_#in~cond| 0))} {9455#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} #60#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,497 INFO L272 TraceCheckUtils]: 13: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,497 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,497 INFO L272 TraceCheckUtils]: 18: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,498 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,498 INFO L272 TraceCheckUtils]: 23: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,498 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,498 INFO L272 TraceCheckUtils]: 28: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,499 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,499 INFO L272 TraceCheckUtils]: 33: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,500 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,500 INFO L272 TraceCheckUtils]: 40: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,501 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,501 INFO L272 TraceCheckUtils]: 45: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,501 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,501 INFO L272 TraceCheckUtils]: 50: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,502 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,502 INFO L272 TraceCheckUtils]: 55: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,503 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9435#true} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,503 INFO L272 TraceCheckUtils]: 60: Hoare triple {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {9435#true} ~cond := #in~cond; {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:59:14,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:14,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:14,504 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9473#(and (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,506 INFO L272 TraceCheckUtils]: 67: Hoare triple {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9435#true} {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,507 INFO L272 TraceCheckUtils]: 72: Hoare triple {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9435#true} {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,507 INFO L272 TraceCheckUtils]: 77: Hoare triple {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:14,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:14,508 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9435#true} {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,508 INFO L272 TraceCheckUtils]: 82: Hoare triple {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,508 INFO L290 TraceCheckUtils]: 83: Hoare triple {9435#true} ~cond := #in~cond; {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:59:14,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:14,509 INFO L290 TraceCheckUtils]: 85: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:14,509 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9638#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {9705#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:14,509 INFO L272 TraceCheckUtils]: 87: Hoare triple {9705#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:14,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {9435#true} ~cond := #in~cond; {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:59:14,510 INFO L290 TraceCheckUtils]: 89: Hoare triple {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:14,510 INFO L290 TraceCheckUtils]: 90: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:14,510 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9705#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {9705#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,512 WARN L290 TraceCheckUtils]: 92: Hoare triple {9705#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9724#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} is UNKNOWN [2022-04-07 12:59:16,513 INFO L290 TraceCheckUtils]: 93: Hoare triple {9724#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !false; {9724#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,513 INFO L272 TraceCheckUtils]: 94: Hoare triple {9724#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:16,513 INFO L290 TraceCheckUtils]: 95: Hoare triple {9435#true} ~cond := #in~cond; {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:59:16,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:16,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:16,515 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9724#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= 0 main_~a~0) (<= main_~a~0 10))} #62#return; {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,515 INFO L272 TraceCheckUtils]: 99: Hoare triple {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:16,515 INFO L290 TraceCheckUtils]: 100: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:16,515 INFO L290 TraceCheckUtils]: 101: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:16,515 INFO L290 TraceCheckUtils]: 102: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:16,515 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9435#true} {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #64#return; {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,515 INFO L272 TraceCheckUtils]: 104: Hoare triple {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:16,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:16,516 INFO L290 TraceCheckUtils]: 106: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:16,516 INFO L290 TraceCheckUtils]: 107: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:16,516 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9435#true} {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #66#return; {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,516 INFO L272 TraceCheckUtils]: 109: Hoare triple {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:16,516 INFO L290 TraceCheckUtils]: 110: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:16,516 INFO L290 TraceCheckUtils]: 111: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:16,516 INFO L290 TraceCheckUtils]: 112: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:16,517 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9435#true} {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #68#return; {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,517 INFO L272 TraceCheckUtils]: 114: Hoare triple {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:16,517 INFO L290 TraceCheckUtils]: 115: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:16,517 INFO L290 TraceCheckUtils]: 116: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:16,517 INFO L290 TraceCheckUtils]: 117: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:16,517 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9435#true} {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} #70#return; {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,518 INFO L290 TraceCheckUtils]: 119: Hoare triple {9743#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= main_~a~0 10))} assume !(~n~0 <= ~a~0); {9807#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,518 INFO L272 TraceCheckUtils]: 120: Hoare triple {9807#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:16,518 INFO L290 TraceCheckUtils]: 121: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 12:59:16,518 INFO L290 TraceCheckUtils]: 122: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 12:59:16,518 INFO L290 TraceCheckUtils]: 123: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 12:59:16,519 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9435#true} {9807#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} #72#return; {9807#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,519 INFO L272 TraceCheckUtils]: 125: Hoare triple {9807#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 12:59:16,519 INFO L290 TraceCheckUtils]: 126: Hoare triple {9435#true} ~cond := #in~cond; {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:59:16,519 INFO L290 TraceCheckUtils]: 127: Hoare triple {9627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:16,520 INFO L290 TraceCheckUtils]: 128: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:59:16,523 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9807#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} #74#return; {9838#(and (= (+ (* (* (div (+ (* main_~z~0 main_~z~0) (* (- 1) main_~z~0 main_~y~0) 18 (* main_~z~0 (- 8))) (- 18)) main_~a~0) 6) (* (div (+ (* main_~z~0 main_~z~0) (* (- 1) main_~z~0 main_~y~0) 18 (* main_~z~0 (- 8))) (- 18)) 12)) (* (div (+ (* main_~z~0 main_~z~0) (* (- 1) main_~z~0 main_~y~0) 18 (* main_~z~0 (- 8))) (- 18)) main_~z~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} is VALID [2022-04-07 12:59:16,525 INFO L272 TraceCheckUtils]: 130: Hoare triple {9838#(and (= (+ (* (* (div (+ (* main_~z~0 main_~z~0) (* (- 1) main_~z~0 main_~y~0) 18 (* main_~z~0 (- 8))) (- 18)) main_~a~0) 6) (* (div (+ (* main_~z~0 main_~z~0) (* (- 1) main_~z~0 main_~y~0) 18 (* main_~z~0 (- 8))) (- 18)) 12)) (* (div (+ (* main_~z~0 main_~z~0) (* (- 1) main_~z~0 main_~y~0) 18 (* main_~z~0 (- 8))) (- 18)) main_~z~0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (<= main_~a~0 10))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {9842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:59:16,526 INFO L290 TraceCheckUtils]: 131: Hoare triple {9842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:59:16,526 INFO L290 TraceCheckUtils]: 132: Hoare triple {9846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9436#false} is VALID [2022-04-07 12:59:16,526 INFO L290 TraceCheckUtils]: 133: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2022-04-07 12:59:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 261 proven. 74 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2022-04-07 12:59:16,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:00:03,376 INFO L290 TraceCheckUtils]: 133: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2022-04-07 13:00:03,377 INFO L290 TraceCheckUtils]: 132: Hoare triple {9846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9436#false} is VALID [2022-04-07 13:00:03,377 INFO L290 TraceCheckUtils]: 131: Hoare triple {9842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:00:03,378 INFO L272 TraceCheckUtils]: 130: Hoare triple {9862#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {9842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:00:03,378 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9866#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #74#return; {9862#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-07 13:00:03,378 INFO L290 TraceCheckUtils]: 128: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:00:03,379 INFO L290 TraceCheckUtils]: 127: Hoare triple {9876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:00:03,379 INFO L290 TraceCheckUtils]: 126: Hoare triple {9435#true} ~cond := #in~cond; {9876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:00:03,379 INFO L272 TraceCheckUtils]: 125: Hoare triple {9866#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,380 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {9435#true} {9866#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #72#return; {9866#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-07 13:00:03,380 INFO L290 TraceCheckUtils]: 123: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,380 INFO L290 TraceCheckUtils]: 122: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,380 INFO L290 TraceCheckUtils]: 121: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,380 INFO L272 TraceCheckUtils]: 120: Hoare triple {9866#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,380 INFO L290 TraceCheckUtils]: 119: Hoare triple {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {9866#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-07 13:00:03,381 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {9435#true} {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #70#return; {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 13:00:03,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,381 INFO L290 TraceCheckUtils]: 116: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,381 INFO L290 TraceCheckUtils]: 115: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,381 INFO L272 TraceCheckUtils]: 114: Hoare triple {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,381 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {9435#true} {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #68#return; {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 13:00:03,381 INFO L290 TraceCheckUtils]: 112: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,381 INFO L290 TraceCheckUtils]: 111: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,382 INFO L290 TraceCheckUtils]: 110: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,382 INFO L272 TraceCheckUtils]: 109: Hoare triple {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,382 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9435#true} {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #66#return; {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 13:00:03,382 INFO L290 TraceCheckUtils]: 107: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,382 INFO L272 TraceCheckUtils]: 104: Hoare triple {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,385 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {9435#true} {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #64#return; {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 13:00:03,385 INFO L290 TraceCheckUtils]: 102: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,385 INFO L290 TraceCheckUtils]: 101: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,385 INFO L290 TraceCheckUtils]: 100: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,385 INFO L272 TraceCheckUtils]: 99: Hoare triple {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,386 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9962#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #62#return; {9898#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 13:00:03,386 INFO L290 TraceCheckUtils]: 97: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:00:03,386 INFO L290 TraceCheckUtils]: 96: Hoare triple {9876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:00:03,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {9435#true} ~cond := #in~cond; {9876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:00:03,387 INFO L272 TraceCheckUtils]: 94: Hoare triple {9962#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {9962#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !false; {9962#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 13:00:03,392 INFO L290 TraceCheckUtils]: 92: Hoare triple {9981#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (not (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9962#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 13:00:03,864 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} {9435#true} #70#return; {9981#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (not (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-07 13:00:03,864 INFO L290 TraceCheckUtils]: 90: Hoare triple {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:00:03,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {9876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {9435#true} ~cond := #in~cond; {9876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:00:03,865 INFO L272 TraceCheckUtils]: 87: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9435#true} {9435#true} #68#return; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 85: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L272 TraceCheckUtils]: 82: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9435#true} {9435#true} #66#return; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L272 TraceCheckUtils]: 77: Hoare triple {9435#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9435#true} {9435#true} #64#return; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 75: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L272 TraceCheckUtils]: 72: Hoare triple {9435#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9435#true} {9435#true} #62#return; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 69: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 68: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L272 TraceCheckUtils]: 67: Hoare triple {9435#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {9435#true} assume !false; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {9435#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9435#true} {9435#true} #70#return; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L272 TraceCheckUtils]: 60: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9435#true} {9435#true} #68#return; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L272 TraceCheckUtils]: 55: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9435#true} {9435#true} #66#return; {9435#true} is VALID [2022-04-07 13:00:03,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L272 TraceCheckUtils]: 50: Hoare triple {9435#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9435#true} {9435#true} #64#return; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L272 TraceCheckUtils]: 45: Hoare triple {9435#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9435#true} {9435#true} #62#return; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L272 TraceCheckUtils]: 40: Hoare triple {9435#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {9435#true} assume !false; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {9435#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9435#true} {9435#true} #70#return; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L272 TraceCheckUtils]: 33: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,867 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9435#true} {9435#true} #68#return; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L272 TraceCheckUtils]: 28: Hoare triple {9435#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9435#true} {9435#true} #66#return; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L272 TraceCheckUtils]: 23: Hoare triple {9435#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9435#true} {9435#true} #64#return; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L272 TraceCheckUtils]: 18: Hoare triple {9435#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9435#true} {9435#true} #62#return; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L272 TraceCheckUtils]: 13: Hoare triple {9435#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {9435#true} assume !false; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {9435#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9435#true} is VALID [2022-04-07 13:00:03,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9435#true} {9435#true} #60#return; {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {9435#true} assume !(0 == ~cond); {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {9435#true} ~cond := #in~cond; {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {9435#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {9435#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret5 := main(); {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9435#true} {9435#true} #84#return; {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {9435#true} assume true; {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {9435#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(13, 2);call #Ultimate.allocInit(12, 3); {9435#true} is VALID [2022-04-07 13:00:03,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2022-04-07 13:00:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 204 proven. 34 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-04-07 13:00:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:00:03,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819695335] [2022-04-07 13:00:03,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:00:03,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711690111] [2022-04-07 13:00:03,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711690111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:00:03,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:00:03,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-07 13:00:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582231769] [2022-04-07 13:00:03,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:00:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 134 [2022-04-07 13:00:03,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:00:03,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-07 13:00:07,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 102 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 13:00:07,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 13:00:07,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:00:07,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 13:00:07,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=365, Unknown=1, NotChecked=0, Total=462 [2022-04-07 13:00:07,987 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-07 13:00:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:00:18,763 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-07 13:00:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 13:00:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 134 [2022-04-07 13:00:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:00:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-07 13:00:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-07 13:00:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-07 13:00:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-07 13:00:18,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 47 transitions. [2022-04-07 13:00:18,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:00:18,885 INFO L225 Difference]: With dead ends: 115 [2022-04-07 13:00:18,885 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 13:00:18,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=136, Invalid=513, Unknown=1, NotChecked=0, Total=650 [2022-04-07 13:00:18,886 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:00:18,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-07 13:00:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 13:00:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 13:00:18,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:00:18,887 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 13:00:18,887 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 13:00:18,887 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 13:00:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:00:18,887 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 13:00:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 13:00:18,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:00:18,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:00:18,887 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 13:00:18,887 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 13:00:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:00:18,887 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 13:00:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 13:00:18,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:00:18,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:00:18,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:00:18,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:00:18,888 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 13:00:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 13:00:18,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2022-04-07 13:00:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:00:18,888 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 13:00:18,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2022-04-07 13:00:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 13:00:18,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:00:18,890 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 13:00:18,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-07 13:00:19,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 13:00:19,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 13:00:22,303 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-07 13:00:22,303 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-07 13:00:22,303 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-07 13:00:22,303 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-07 13:00:22,303 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-07 13:00:22,303 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-07 13:00:22,303 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-07 13:00:22,303 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (<= main_~a~0 10)) [2022-04-07 13:00:22,303 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) .cse0 (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1) (<= main_~a~0 10))))) [2022-04-07 13:00:22,303 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 56) no Hoare annotation was computed. [2022-04-07 13:00:22,303 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) .cse0 (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (<= .cse1 (+ main_~a~0 1)) (< main_~a~0 .cse1) (<= main_~a~0 10))))) [2022-04-07 13:00:22,304 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 56) no Hoare annotation was computed. [2022-04-07 13:00:22,304 INFO L882 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (<= main_~a~0 10)) [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (<= main_~a~0 10)) [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (<= main_~a~0 10)) [2022-04-07 13:00:22,304 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* (- 1) main_~a~0))) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ .cse0 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) .cse0) 65536) 1)) (< main_~a~0 0)))) [2022-04-07 13:00:22,304 INFO L882 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-04-07 13:00:22,304 INFO L882 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (let ((.cse0 (* main_~z~0 main_~z~0)) (.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) .cse0 18)) (= (+ .cse0 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse1 (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)) (< main_~a~0 .cse2) (<= main_~a~0 10))) (and (= main_~x~0 0) (= main_~y~0 1) .cse1 (= main_~z~0 6)))) [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (<= main_~a~0 10)) [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0) (<= main_~a~0 10)) [2022-04-07 13:00:22,304 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 13:00:22,304 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 13:00:22,304 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 13:00:22,305 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 13:00:22,305 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 13:00:22,305 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 13:00:22,305 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 13:00:22,305 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-07 13:00:22,305 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-07 13:00:22,305 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-07 13:00:22,305 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-07 13:00:22,305 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-07 13:00:22,305 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-07 13:00:22,307 INFO L719 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1] [2022-04-07 13:00:22,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 13:00:22,309 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 13:00:22,309 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 13:00:22,311 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 13:00:22,313 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,320 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:00:22,321 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 13:00:22,321 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 13:00:22,321 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 13:00:22,321 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 13:00:22,321 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 13:00:22,321 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 13:00:22,321 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 13:00:22,321 INFO L163 areAnnotationChecker]: CFG has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 13:00:22,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 01:00:22 BoogieIcfgContainer [2022-04-07 13:00:22,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 13:00:22,329 INFO L158 Benchmark]: Toolchain (without parser) took 157405.55ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 139.8MB in the beginning and 196.5MB in the end (delta: -56.7MB). Peak memory consumption was 139.1MB. Max. memory is 8.0GB. [2022-04-07 13:00:22,330 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 189.8MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 13:00:22,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.34ms. Allocated memory is still 189.8MB. Free memory was 139.5MB in the beginning and 164.8MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 13:00:22,330 INFO L158 Benchmark]: Boogie Preprocessor took 23.62ms. Allocated memory is still 189.8MB. Free memory was 164.8MB in the beginning and 163.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 13:00:22,330 INFO L158 Benchmark]: RCFGBuilder took 186.17ms. Allocated memory is still 189.8MB. Free memory was 163.1MB in the beginning and 151.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 13:00:22,332 INFO L158 Benchmark]: TraceAbstraction took 157014.92ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 151.2MB in the beginning and 196.5MB in the end (delta: -45.3MB). Peak memory consumption was 151.1MB. Max. memory is 8.0GB. [2022-04-07 13:00:22,334 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.08ms. Allocated memory is still 189.8MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.34ms. Allocated memory is still 189.8MB. Free memory was 139.5MB in the beginning and 164.8MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.62ms. Allocated memory is still 189.8MB. Free memory was 164.8MB in the beginning and 163.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 186.17ms. Allocated memory is still 189.8MB. Free memory was 163.1MB in the beginning and 151.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 157014.92ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 151.2MB in the beginning and 196.5MB in the end (delta: -45.3MB). Peak memory consumption was 151.1MB. Max. memory is 8.0GB. * 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: 17]: 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 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 156.9s, OverallIterations: 15, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 2045 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1443 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2321 IncrementalHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 602 mSDtfsCounter, 2321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1533 GetRequests, 1371 SyntacticMatches, 11 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 70 PreInvPairs, 115 NumberOfFragments, 619 HoareAnnotationTreeSize, 70 FomulaSimplifications, 2556 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 29005 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 120.8s InterpolantComputationTime, 985 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1342 ConstructedInterpolants, 0 QuantifiedInterpolants, 5733 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1925 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 5635/5874 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: 33]: Loop Invariant Derived loop invariant: ((((n <= a + 1 && z * z + 12 == y * 12 + z * 6) && n * 6 + 6 == z) && 0 <= a) && n * n * n == x) && a <= 10 RESULT: Ultimate proved your program to be correct! [2022-04-07 13:00:22,366 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...