/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/geo1-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 14:06:39,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 14:06:39,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 14:06:39,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 14:06:39,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 14:06:39,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 14:06:39,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 14:06:39,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 14:06:39,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 14:06:39,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 14:06:39,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 14:06:39,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 14:06:39,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 14:06:39,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 14:06:39,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 14:06:39,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 14:06:39,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 14:06:39,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 14:06:39,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 14:06:39,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 14:06:39,370 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 14:06:39,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 14:06:39,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 14:06:39,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 14:06:39,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 14:06:39,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 14:06:39,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 14:06:39,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 14:06:39,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 14:06:39,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 14:06:39,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 14:06:39,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 14:06:39,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 14:06:39,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 14:06:39,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 14:06:39,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 14:06:39,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 14:06:39,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 14:06:39,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 14:06:39,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 14:06:39,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 14:06:39,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 14:06:39,383 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 14:06:39,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 14:06:39,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 14:06:39,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 14:06:39,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 14:06:39,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 14:06:39,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 14:06:39,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 14:06:39,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 14:06:39,404 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 14:06:39,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 14:06:39,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 14:06:39,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 14:06:39,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 14:06:39,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 14:06:39,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 14:06:39,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 14:06:39,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 14:06:39,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 14:06:39,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 14:06:39,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 14:06:39,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 14:06:39,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 14:06:39,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 14:06:39,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 14:06:39,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:06:39,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 14:06:39,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 14:06:39,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 14:06:39,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 14:06:39,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 14:06:39,407 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 14:06:39,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 14:06:39,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 14:06:39,408 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 14:06:39,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 14:06:39,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 14:06:39,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 14:06:39,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 14:06:39,668 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 14:06:39,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound2.c [2022-04-07 14:06:39,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819f24016/32c2b8bf72604dd3a059e71f7a8264c5/FLAG648d10024 [2022-04-07 14:06:40,117 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 14:06:40,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound2.c [2022-04-07 14:06:40,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819f24016/32c2b8bf72604dd3a059e71f7a8264c5/FLAG648d10024 [2022-04-07 14:06:40,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819f24016/32c2b8bf72604dd3a059e71f7a8264c5 [2022-04-07 14:06:40,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 14:06:40,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 14:06:40,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 14:06:40,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 14:06:40,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 14:06:40,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d25ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40, skipping insertion in model container [2022-04-07 14:06:40,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 14:06:40,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 14:06:40,692 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/geo1-ll_valuebound2.c[546,559] [2022-04-07 14:06:40,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:06:40,713 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 14:06:40,724 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/geo1-ll_valuebound2.c[546,559] [2022-04-07 14:06:40,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:06:40,745 INFO L208 MainTranslator]: Completed translation [2022-04-07 14:06:40,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40 WrapperNode [2022-04-07 14:06:40,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 14:06:40,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 14:06:40,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 14:06:40,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 14:06:40,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 14:06:40,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 14:06:40,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 14:06:40,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 14:06:40,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (1/1) ... [2022-04-07 14:06:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:06:40,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:06:40,813 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 14:06:40,817 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 14:06:40,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 14:06:40,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 14:06:40,844 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 14:06:40,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 14:06:40,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 14:06:40,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 14:06:40,844 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 14:06:40,844 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 14:06:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 14:06:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 14:06:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 14:06:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 14:06:40,895 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 14:06:40,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 14:06:41,058 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 14:06:41,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 14:06:41,065 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 14:06:41,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:06:41 BoogieIcfgContainer [2022-04-07 14:06:41,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 14:06:41,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 14:06:41,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 14:06:41,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 14:06:41,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:06:40" (1/3) ... [2022-04-07 14:06:41,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589e932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:06:41, skipping insertion in model container [2022-04-07 14:06:41,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:06:40" (2/3) ... [2022-04-07 14:06:41,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589e932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:06:41, skipping insertion in model container [2022-04-07 14:06:41,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:06:41" (3/3) ... [2022-04-07 14:06:41,092 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound2.c [2022-04-07 14:06:41,096 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 14:06:41,096 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 14:06:41,134 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 14:06:41,139 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 14:06:41,139 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 14:06:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 14:06:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 14:06:41,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:06:41,169 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:06:41,170 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:06:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:06:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash 774216096, now seen corresponding path program 1 times [2022-04-07 14:06:41,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:06:41,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352647383] [2022-04-07 14:06:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:06:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:06:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 14:06:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:41,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(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(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 14:06:41,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 14:06:41,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-07 14:06:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 14:06:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:41,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-07 14:06:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 14:06:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:41,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-07 14:06:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 14:06:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:41,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-07 14:06:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 14:06:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:41,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-07 14:06:41,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 14:06:41,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(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(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 14:06:41,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 14:06:41,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-07 14:06:41,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-07 14:06:41,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-07 14:06:41,477 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {35#true} is VALID [2022-04-07 14:06:41,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-07 14:06:41,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-07 14:06:41,479 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {35#true} is VALID [2022-04-07 14:06:41,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,482 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-07 14:06:41,482 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-07 14:06:41,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,484 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-07 14:06:41,484 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-07 14:06:41,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 14:06:41,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 14:06:41,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 14:06:41,485 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-07 14:06:41,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {36#false} is VALID [2022-04-07 14:06:41,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-07 14:06:41,489 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {36#false} is VALID [2022-04-07 14:06:41,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-07 14:06:41,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-07 14:06:41,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-07 14:06:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 14:06:41,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:06:41,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352647383] [2022-04-07 14:06:41,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352647383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:06:41,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:06:41,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 14:06:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194638700] [2022-04-07 14:06:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:06:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 14:06:41,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:06:41,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 14:06:41,556 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 14:06:41,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 14:06:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:06:41,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 14:06:41,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 14:06:41,588 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 14:06:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:41,758 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-07 14:06:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 14:06:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 14:06:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:06:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 14:06:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-07 14:06:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 14:06:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-07 14:06:41,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-07 14:06:41,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:06:41,914 INFO L225 Difference]: With dead ends: 57 [2022-04-07 14:06:41,915 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 14:06:41,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 14:06:41,921 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:06:41,922 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:06:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 14:06:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 14:06:41,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:06:41,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:41,962 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:41,963 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:41,967 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 14:06:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 14:06:41,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:41,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:41,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-07 14:06:41,969 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-07 14:06:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:41,973 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 14:06:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 14:06:41,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:41,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:41,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:06:41,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:06:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 14:06:41,978 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-04-07 14:06:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:06:41,978 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 14:06:41,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 14:06:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 14:06:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 14:06:41,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:06:41,980 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:06:41,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 14:06:41,981 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:06:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:06:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1105237916, now seen corresponding path program 1 times [2022-04-07 14:06:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:06:41,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566729523] [2022-04-07 14:06:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:06:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:06:42,023 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:06:42,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692794628] [2022-04-07 14:06:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:06:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:06:42,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:06:42,030 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 14:06:42,054 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 14:06:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:42,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 14:06:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:42,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:06:42,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-07 14:06:42,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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(10, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-07 14:06:42,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #68#return; {231#true} is VALID [2022-04-07 14:06:42,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(); {231#true} is VALID [2022-04-07 14:06:42,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {231#true} is VALID [2022-04-07 14:06:42,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 14:06:42,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 14:06:42,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 14:06:42,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {231#true} #56#return; {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-07 14:06:42,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-07 14:06:42,553 INFO L272 TraceCheckUtils]: 12: Hoare triple {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-07 14:06:42,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-07 14:06:42,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,554 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#true} {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} #58#return; {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-07 14:06:42,555 INFO L272 TraceCheckUtils]: 17: Hoare triple {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 14:06:42,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 14:06:42,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 14:06:42,557 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {268#(and (<= main_~z~0 2) (<= 0 main_~z~0))} #60#return; {302#(and (<= main_~z~0 2) (<= 1 main_~z~0))} is VALID [2022-04-07 14:06:42,557 INFO L272 TraceCheckUtils]: 22: Hoare triple {302#(and (<= main_~z~0 2) (<= 1 main_~z~0))} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-07 14:06:42,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-07 14:06:42,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,559 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {231#true} {302#(and (<= main_~z~0 2) (<= 1 main_~z~0))} #62#return; {302#(and (<= main_~z~0 2) (<= 1 main_~z~0))} is VALID [2022-04-07 14:06:42,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {302#(and (<= main_~z~0 2) (<= 1 main_~z~0))} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {321#(and (= main_~z~0 main_~y~0) (= main_~x~0 1) (<= main_~z~0 2) (<= 1 main_~z~0))} is VALID [2022-04-07 14:06:42,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {321#(and (= main_~z~0 main_~y~0) (= main_~x~0 1) (<= main_~z~0 2) (<= 1 main_~z~0))} assume !false; {321#(and (= main_~z~0 main_~y~0) (= main_~x~0 1) (<= main_~z~0 2) (<= 1 main_~z~0))} is VALID [2022-04-07 14:06:42,561 INFO L272 TraceCheckUtils]: 29: Hoare triple {321#(and (= main_~z~0 main_~y~0) (= main_~x~0 1) (<= main_~z~0 2) (<= 1 main_~z~0))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 14:06:42,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:06:42,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-07 14:06:42,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-07 14:06:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 14:06:42,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:06:42,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-07 14:06:42,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-07 14:06:42,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:06:42,907 INFO L272 TraceCheckUtils]: 29: Hoare triple {348#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 14:06:42,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {348#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !false; {348#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 14:06:42,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {231#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {348#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 14:06:42,909 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {231#true} {231#true} #62#return; {231#true} is VALID [2022-04-07 14:06:42,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-07 14:06:42,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-07 14:06:42,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {231#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,909 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {231#true} {231#true} #60#return; {231#true} is VALID [2022-04-07 14:06:42,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-07 14:06:42,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-07 14:06:42,910 INFO L272 TraceCheckUtils]: 17: Hoare triple {231#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,910 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#true} {231#true} #58#return; {231#true} is VALID [2022-04-07 14:06:42,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-07 14:06:42,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-07 14:06:42,911 INFO L272 TraceCheckUtils]: 12: Hoare triple {231#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {231#true} is VALID [2022-04-07 14:06:42,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {231#true} {231#true} #56#return; {231#true} is VALID [2022-04-07 14:06:42,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-07 14:06:42,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-07 14:06:42,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {231#true} is VALID [2022-04-07 14:06:42,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {231#true} is VALID [2022-04-07 14:06:42,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(); {231#true} is VALID [2022-04-07 14:06:42,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #68#return; {231#true} is VALID [2022-04-07 14:06:42,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-07 14:06:42,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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(10, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-07 14:06:42,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-07 14:06:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 14:06:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:06:42,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566729523] [2022-04-07 14:06:42,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:06:42,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692794628] [2022-04-07 14:06:42,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692794628] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 14:06:42,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 14:06:42,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-07 14:06:42,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427064287] [2022-04-07 14:06:42,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:06:42,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-07 14:06:42,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:06:42,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 14:06:42,954 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 14:06:42,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:06:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:06:42,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:06:42,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:06:42,956 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 14:06:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:43,185 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 14:06:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:06:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-07 14:06:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:06:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 14:06:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 14:06:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 14:06:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 14:06:43,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-07 14:06:43,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:06:43,245 INFO L225 Difference]: With dead ends: 33 [2022-04-07 14:06:43,245 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 14:06:43,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 14:06:43,246 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:06:43,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 14:06:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 14:06:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 14:06:43,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:06:43,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:43,255 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:43,255 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:43,258 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-07 14:06:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-07 14:06:43,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:43,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:43,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 14:06:43,259 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 14:06:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:43,261 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-07 14:06:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-07 14:06:43,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:43,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:43,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:06:43,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:06:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 14:06:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-07 14:06:43,264 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 33 [2022-04-07 14:06:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:06:43,265 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-07 14:06:43,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 14:06:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-07 14:06:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 14:06:43,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:06:43,266 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:06:43,290 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 14:06:43,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:06:43,480 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:06:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:06:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1493430927, now seen corresponding path program 1 times [2022-04-07 14:06:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:06:43,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903496596] [2022-04-07 14:06:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:06:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:06:43,504 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:06:43,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578712700] [2022-04-07 14:06:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:06:43,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:06:43,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:06:43,506 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 14:06:43,531 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 14:06:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:43,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 14:06:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:06:43,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:06:43,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-07 14:06:43,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#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(10, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-07 14:06:43,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:43,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #68#return; {588#true} is VALID [2022-04-07 14:06:43,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret6 := main(); {588#true} is VALID [2022-04-07 14:06:43,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {588#true} is VALID [2022-04-07 14:06:43,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {588#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:43,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:43,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:43,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:43,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {588#true} {588#true} #56#return; {588#true} is VALID [2022-04-07 14:06:43,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {588#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {588#true} is VALID [2022-04-07 14:06:43,873 INFO L272 TraceCheckUtils]: 12: Hoare triple {588#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:43,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:43,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:43,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:43,873 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {588#true} {588#true} #58#return; {588#true} is VALID [2022-04-07 14:06:43,874 INFO L272 TraceCheckUtils]: 17: Hoare triple {588#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:43,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:43,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:43,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:43,874 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {588#true} {588#true} #60#return; {588#true} is VALID [2022-04-07 14:06:43,874 INFO L272 TraceCheckUtils]: 22: Hoare triple {588#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:43,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:43,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:43,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:43,875 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {588#true} {588#true} #62#return; {588#true} is VALID [2022-04-07 14:06:43,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {588#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {588#true} is VALID [2022-04-07 14:06:43,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {588#true} assume !false; {588#true} is VALID [2022-04-07 14:06:43,875 INFO L272 TraceCheckUtils]: 29: Hoare triple {588#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:43,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {588#true} ~cond := #in~cond; {683#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:06:43,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {687#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:06:43,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {687#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:06:43,878 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {687#(not (= |__VERIFIER_assert_#in~cond| 0))} {588#true} #64#return; {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 14:06:43,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 14:06:43,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {701#(exists ((v_main_~x~0_12 Int) (main_~z~0 Int)) (and (= main_~x~0 (* v_main_~x~0_12 (+ (- 1) main_~z~0))) (= (+ (* v_main_~x~0_12 main_~z~0) 1) (+ v_main_~x~0_12 main_~y~0))))} is VALID [2022-04-07 14:06:43,888 INFO L272 TraceCheckUtils]: 36: Hoare triple {701#(exists ((v_main_~x~0_12 Int) (main_~z~0 Int)) (and (= main_~x~0 (* v_main_~x~0_12 (+ (- 1) main_~z~0))) (= (+ (* v_main_~x~0_12 main_~z~0) 1) (+ v_main_~x~0_12 main_~y~0))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {705#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 14:06:43,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {705#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {709#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:06:43,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {709#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {589#false} is VALID [2022-04-07 14:06:43,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-07 14:06:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 14:06:43,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:06:46,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-07 14:06:46,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {709#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {589#false} is VALID [2022-04-07 14:06:46,260 INFO L290 TraceCheckUtils]: 37: Hoare triple {705#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {709#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:06:46,261 INFO L272 TraceCheckUtils]: 36: Hoare triple {725#(= (+ main_~x~0 1) main_~y~0)} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {705#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 14:06:46,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {725#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-07 14:06:46,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 14:06:46,263 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {687#(not (= |__VERIFIER_assert_#in~cond| 0))} {588#true} #64#return; {694#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 14:06:46,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {687#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:06:46,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {744#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {687#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 14:06:46,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {588#true} ~cond := #in~cond; {744#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 14:06:46,265 INFO L272 TraceCheckUtils]: 29: Hoare triple {588#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:46,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {588#true} assume !false; {588#true} is VALID [2022-04-07 14:06:46,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {588#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {588#true} is VALID [2022-04-07 14:06:46,265 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {588#true} {588#true} #62#return; {588#true} is VALID [2022-04-07 14:06:46,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:46,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:46,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:46,266 INFO L272 TraceCheckUtils]: 22: Hoare triple {588#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:46,266 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {588#true} {588#true} #60#return; {588#true} is VALID [2022-04-07 14:06:46,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:46,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:46,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:46,266 INFO L272 TraceCheckUtils]: 17: Hoare triple {588#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:46,267 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {588#true} {588#true} #58#return; {588#true} is VALID [2022-04-07 14:06:46,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:46,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:46,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:46,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {588#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:46,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {588#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {588#true} is VALID [2022-04-07 14:06:46,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {588#true} {588#true} #56#return; {588#true} is VALID [2022-04-07 14:06:46,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:46,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {588#true} assume !(0 == ~cond); {588#true} is VALID [2022-04-07 14:06:46,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {588#true} ~cond := #in~cond; {588#true} is VALID [2022-04-07 14:06:46,268 INFO L272 TraceCheckUtils]: 6: Hoare triple {588#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {588#true} is VALID [2022-04-07 14:06:46,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {588#true} is VALID [2022-04-07 14:06:46,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret6 := main(); {588#true} is VALID [2022-04-07 14:06:46,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #68#return; {588#true} is VALID [2022-04-07 14:06:46,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-07 14:06:46,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#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(10, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-07 14:06:46,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-07 14:06:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 14:06:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:06:46,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903496596] [2022-04-07 14:06:46,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:06:46,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578712700] [2022-04-07 14:06:46,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578712700] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:06:46,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:06:46,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 14:06:46,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696406311] [2022-04-07 14:06:46,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:06:46,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-07 14:06:46,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:06:46,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 14:06:46,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:06:46,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:06:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:06:46,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:06:46,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:06:46,304 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 14:06:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:46,524 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-07 14:06:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 14:06:46,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-07 14:06:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:06:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 14:06:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 14:06:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 14:06:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 14:06:46,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-07 14:06:46,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 14:06:46,579 INFO L225 Difference]: With dead ends: 29 [2022-04-07 14:06:46,579 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 14:06:46,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-07 14:06:46,580 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:06:46,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-04-07 14:06:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 14:06:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 14:06:46,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:06:46,582 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 14:06:46,582 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 14:06:46,582 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 14:06:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:46,582 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 14:06:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 14:06:46,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:46,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:46,583 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 14:06:46,583 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 14:06:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:06:46,583 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 14:06:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 14:06:46,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:46,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:06:46,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:06:46,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:06:46,583 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 14:06:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 14:06:46,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-04-07 14:06:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:06:46,584 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 14:06:46,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 14:06:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 14:06:46,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:06:46,587 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 14:06:46,614 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 14:06:46,803 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,SelfDestructingSolverStorable2 [2022-04-07 14:06:46,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 14:06:46,832 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-07 14:06:46,833 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-07 14:06:46,833 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-07 14:06:46,833 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-07 14:06:46,833 INFO L882 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-04-07 14:06:46,833 INFO L882 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-04-07 14:06:46,833 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-07 14:06:46,834 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-07 14:06:46,834 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 52) no Hoare annotation was computed. [2022-04-07 14:06:46,834 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (= (+ main_~x~0 1) main_~y~0) [2022-04-07 14:06:46,834 INFO L882 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-04-07 14:06:46,834 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 52) no Hoare annotation was computed. [2022-04-07 14:06:46,834 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-07 14:06:46,834 INFO L882 garLoopResultBuilder]: For program point L36-3(lines 36 46) no Hoare annotation was computed. [2022-04-07 14:06:46,834 INFO L882 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-04-07 14:06:46,834 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 52) the Hoare annotation is: true [2022-04-07 14:06:46,834 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-07 14:06:46,835 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-07 14:06:46,835 INFO L885 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-07 14:06:46,835 INFO L882 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-04-07 14:06:46,835 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-07 14:06:46,835 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 36 46) no Hoare annotation was computed. [2022-04-07 14:06:46,835 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 14:06:46,835 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 14:06:46,835 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 14:06:46,836 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 14:06:46,836 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 14:06:46,836 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 14:06:46,836 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 14:06:46,836 INFO L882 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-04-07 14:06:46,836 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-04-07 14:06:46,836 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-07 14:06:46,836 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-04-07 14:06:46,836 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-04-07 14:06:46,837 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-04-07 14:06:46,839 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 14:06:46,841 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 14:06:46,844 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 14:06:46,844 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 14:06:46,845 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 14:06:46,845 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 14:06:46,845 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 14:06:46,845 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 14:06:46,845 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 14:06:46,846 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-07 14:06:46,847 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-07 14:06:46,848 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-07 14:06:46,848 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 14:06:46,848 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-07 14:06:46,848 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-07 14:06:46,848 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 14:06:46,848 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 14:06:46,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:06:46 BoogieIcfgContainer [2022-04-07 14:06:46,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 14:06:46,856 INFO L158 Benchmark]: Toolchain (without parser) took 6322.68ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 121.6MB in the beginning and 123.5MB in the end (delta: -1.9MB). Peak memory consumption was 35.9MB. Max. memory is 8.0GB. [2022-04-07 14:06:46,857 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory was 138.5MB in the beginning and 138.4MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 14:06:46,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.53ms. Allocated memory is still 169.9MB. Free memory was 121.4MB in the beginning and 147.1MB in the end (delta: -25.7MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-07 14:06:46,858 INFO L158 Benchmark]: Boogie Preprocessor took 37.85ms. Allocated memory is still 169.9MB. Free memory was 147.1MB in the beginning and 145.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 14:06:46,858 INFO L158 Benchmark]: RCFGBuilder took 282.23ms. Allocated memory is still 169.9MB. Free memory was 145.7MB in the beginning and 134.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 14:06:46,860 INFO L158 Benchmark]: TraceAbstraction took 5774.44ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 134.1MB in the beginning and 123.5MB in the end (delta: 10.7MB). Peak memory consumption was 46.7MB. Max. memory is 8.0GB. [2022-04-07 14:06:46,864 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.16ms. Allocated memory is still 169.9MB. Free memory was 138.5MB in the beginning and 138.4MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.53ms. Allocated memory is still 169.9MB. Free memory was 121.4MB in the beginning and 147.1MB in the end (delta: -25.7MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.85ms. Allocated memory is still 169.9MB. Free memory was 147.1MB in the beginning and 145.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 282.23ms. Allocated memory is still 169.9MB. Free memory was 145.7MB in the beginning and 134.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5774.44ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 134.1MB in the beginning and 123.5MB in the end (delta: 10.7MB). Peak memory consumption was 46.7MB. 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: 18]: 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 80 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 22 PreInvPairs, 28 NumberOfFragments, 39 HoareAnnotationTreeSize, 22 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 174 ConstructedInterpolants, 1 QuantifiedInterpolants, 356 SizeOfPredicates, 6 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 113/124 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: 36]: Loop Invariant Derived loop invariant: z * x + 1 == y + x RESULT: Ultimate proved your program to be correct! [2022-04-07 14:06:46,880 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...