/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:13:52,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:13:52,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:13:52,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:13:52,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:13:52,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:13:52,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:13:52,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:13:52,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:13:52,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:13:52,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:13:52,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:13:52,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:13:52,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:13:52,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:13:52,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:13:52,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:13:52,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:13:52,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:13:52,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:13:52,093 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:13:52,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:13:52,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:13:52,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:13:52,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:13:52,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:13:52,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:13:52,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:13:52,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:13:52,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:13:52,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:13:52,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:13:52,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:13:52,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:13:52,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:13:52,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:13:52,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:13:52,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:13:52,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:13:52,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:13:52,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:13:52,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:13:52,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:13:52,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:13:52,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:13:52,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:13:52,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:13:52,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:13:52,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:13:52,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:13:52,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:13:52,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:13:52,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:13:52,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:13:52,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:13:52,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:13:52,120 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:13:52,121 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-14 20:13:52,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:13:52,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:13:52,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:13:52,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:13:52,321 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:13:52,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo2-ll.c [2022-04-14 20:13:52,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b64755a/82e18a521222472791ead06185ce9ebd/FLAG139681b46 [2022-04-14 20:13:52,700 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:13:52,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo2-ll.c [2022-04-14 20:13:52,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b64755a/82e18a521222472791ead06185ce9ebd/FLAG139681b46 [2022-04-14 20:13:52,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b64755a/82e18a521222472791ead06185ce9ebd [2022-04-14 20:13:52,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:13:52,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:13:52,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:13:52,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:13:52,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:13:52,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2336b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52, skipping insertion in model container [2022-04-14 20:13:52,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:13:52,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:13:52,844 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/geo2-ll.c[525,538] [2022-04-14 20:13:52,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:13:52,857 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:13:52,869 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/geo2-ll.c[525,538] [2022-04-14 20:13:52,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:13:52,880 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:13:52,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52 WrapperNode [2022-04-14 20:13:52,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:13:52,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:13:52,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:13:52,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:13:52,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:13:52,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:13:52,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:13:52,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:13:52,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (1/1) ... [2022-04-14 20:13:52,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:13:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:13:52,919 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-14 20:13:52,927 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-14 20:13:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:13:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:13:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:13:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 20:13:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:13:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:13:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:13:52,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:13:52,987 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:13:52,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:13:53,082 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:13:53,090 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:13:53,090 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:13:53,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:13:53 BoogieIcfgContainer [2022-04-14 20:13:53,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:13:53,093 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:13:53,093 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:13:53,094 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:13:53,096 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:13:53" (1/1) ... [2022-04-14 20:13:53,097 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:13:53,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:13:53 BasicIcfg [2022-04-14 20:13:53,118 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:13:53,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:13:53,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:13:53,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:13:53,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:13:52" (1/4) ... [2022-04-14 20:13:53,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e7ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:13:53, skipping insertion in model container [2022-04-14 20:13:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:13:52" (2/4) ... [2022-04-14 20:13:53,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e7ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:13:53, skipping insertion in model container [2022-04-14 20:13:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:13:53" (3/4) ... [2022-04-14 20:13:53,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e7ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:13:53, skipping insertion in model container [2022-04-14 20:13:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:13:53" (4/4) ... [2022-04-14 20:13:53,123 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll.cJordan [2022-04-14 20:13:53,126 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:13:53,126 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:13:53,151 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:13:53,155 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-14 20:13:53,155 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:13:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 20:13:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 20:13:53,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:13:53,170 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:13:53,170 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:13:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:13:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1229966674, now seen corresponding path program 1 times [2022-04-14 20:13:53,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:13:53,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547794347] [2022-04-14 20:13:53,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:13:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:13:53,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:13:53,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141583160] [2022-04-14 20:13:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:13:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:13:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:13:53,241 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-14 20:13:53,242 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-14 20:13:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:13:53,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:13:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:13:53,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:13:53,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:13:53,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-14 20:13:53,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [61] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:13:53,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:13:53,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [57] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:13:53,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [60] mainENTRY-->L33-2: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_4 1) (= v_main_~z~0_3 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~c~0_4 1) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_4 1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_4, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_3, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {44#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 20:13:53,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {44#(and (= main_~y~0 1) (= main_~x~0 1))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 20:13:53,432 INFO L272 TraceCheckUtils]: 7: Hoare triple {44#(and (= main_~y~0 1) (= main_~x~0 1))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {51#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:13:53,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {55#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:13:53,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {55#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 20:13:53,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 20:13:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:13:53,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:13:53,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:13:53,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547794347] [2022-04-14 20:13:53,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:13:53,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141583160] [2022-04-14 20:13:53,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141583160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:13:53,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:13:53,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:13:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709035495] [2022-04-14 20:13:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:13:53,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:13:53,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:13:53,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:13:53,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:13:53,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:13:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:13:53,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:13:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:13:53,471 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:13:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:13:53,595 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-14 20:13:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:13:53,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:13:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:13:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:13:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 20:13:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:13:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 20:13:53,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-14 20:13:53,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:13:53,651 INFO L225 Difference]: With dead ends: 32 [2022-04-14 20:13:53,651 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 20:13:53,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:13:53,656 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:13:53,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:13:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 20:13:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-14 20:13:53,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:13:53,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 20:13:53,680 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 20:13:53,681 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 20:13:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:13:53,685 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-14 20:13:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 20:13:53,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:13:53,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:13:53,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-14 20:13:53,686 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-14 20:13:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:13:53,688 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-14 20:13:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 20:13:53,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:13:53,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:13:53,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:13:53,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:13:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 20:13:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-14 20:13:53,696 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2022-04-14 20:13:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:13:53,701 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-14 20:13:53,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:13:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 20:13:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 20:13:53,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:13:53,702 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:13:53,718 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-14 20:13:53,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-14 20:13:53,903 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:13:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:13:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 726352862, now seen corresponding path program 1 times [2022-04-14 20:13:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:13:53,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489265762] [2022-04-14 20:13:53,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:13:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:13:53,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:13:53,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519370233] [2022-04-14 20:13:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:13:53,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:13:53,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:13:53,928 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-14 20:13:53,930 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-14 20:13:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:13:53,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 20:13:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:13:53,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:13:54,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {164#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {164#true} is VALID [2022-04-14 20:13:54,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} [61] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} [57] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} [60] mainENTRY-->L33-2: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_4 1) (= v_main_~z~0_3 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~c~0_4 1) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_4 1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_4, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_3, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {184#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 20:13:54,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(and (= main_~y~0 1) (= main_~x~0 1))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 20:13:54,170 INFO L272 TraceCheckUtils]: 7: Hoare triple {184#(and (= main_~y~0 1) (= main_~x~0 1))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {164#true} is VALID [2022-04-14 20:13:54,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#true} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {164#true} is VALID [2022-04-14 20:13:54,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,172 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {164#true} {184#(and (= main_~y~0 1) (= main_~x~0 1))} [79] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {184#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 20:13:54,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(and (= main_~y~0 1) (= main_~x~0 1))} [70] L34-1-->L33-2: Formula: (and (= (* v_main_~y~0_3 v_main_~z~0_2) v_main_~y~0_2) (= v_main_~x~0_2 (+ (* v_main_~x~0_3 v_main_~z~0_2) 1)) (= v_main_~c~0_2 (+ v_main_~c~0_3 1)) (< v_main_~c~0_3 v_main_~k~0_2)) InVars {main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~y~0=v_main_~y~0_2, main_~c~0=v_main_~c~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {206#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-14 20:13:54,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {206#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-14 20:13:54,174 INFO L272 TraceCheckUtils]: 14: Hoare triple {206#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {213#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:13:54,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {213#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {217#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:13:54,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {165#false} is VALID [2022-04-14 20:13:54,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {165#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#false} is VALID [2022-04-14 20:13:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:13:54,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:13:54,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {165#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#false} is VALID [2022-04-14 20:13:54,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {165#false} is VALID [2022-04-14 20:13:54,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {213#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {217#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:13:54,413 INFO L272 TraceCheckUtils]: 14: Hoare triple {233#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {213#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:13:54,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {233#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-14 20:13:54,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [70] L34-1-->L33-2: Formula: (and (= (* v_main_~y~0_3 v_main_~z~0_2) v_main_~y~0_2) (= v_main_~x~0_2 (+ (* v_main_~x~0_3 v_main_~z~0_2) 1)) (= v_main_~c~0_2 (+ v_main_~c~0_3 1)) (< v_main_~c~0_3 v_main_~k~0_2)) InVars {main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~y~0=v_main_~y~0_2, main_~c~0=v_main_~c~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {233#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-14 20:13:54,417 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {164#true} {240#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [79] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {240#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-14 20:13:54,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#true} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {164#true} is VALID [2022-04-14 20:13:54,417 INFO L272 TraceCheckUtils]: 7: Hoare triple {240#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {164#true} is VALID [2022-04-14 20:13:54,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-14 20:13:54,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} [60] mainENTRY-->L33-2: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_4 1) (= v_main_~z~0_3 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~c~0_4 1) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_4 1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_4, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_3, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {240#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-14 20:13:54,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} [57] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} [61] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {164#true} is VALID [2022-04-14 20:13:54,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {164#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#true} is VALID [2022-04-14 20:13:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:13:54,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:13:54,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489265762] [2022-04-14 20:13:54,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:13:54,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519370233] [2022-04-14 20:13:54,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519370233] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:13:54,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 20:13:54,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-14 20:13:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314546904] [2022-04-14 20:13:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:13:54,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-14 20:13:54,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:13:54,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:13:54,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:13:54,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:13:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:13:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:13:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:13:54,440 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:13:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:13:54,499 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-14 20:13:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:13:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-14 20:13:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:13:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:13:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-14 20:13:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:13:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-14 20:13:54,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-14 20:13:54,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:13:54,526 INFO L225 Difference]: With dead ends: 21 [2022-04-14 20:13:54,526 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:13:54,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:13:54,527 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:13:54,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:13:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:13:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:13:54,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:13:54,528 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-14 20:13:54,528 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-14 20:13:54,528 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-14 20:13:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:13:54,528 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:13:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:13:54,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:13:54,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:13:54,529 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-14 20:13:54,529 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-14 20:13:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:13:54,529 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:13:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:13:54,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:13:54,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:13:54,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:13:54,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:13:54,529 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-14 20:13:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:13:54,529 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-14 20:13:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:13:54,529 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:13:54,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 20:13:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:13:54,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:13:54,532 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:13:54,553 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-14 20:13:54,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-14 20:13:54,746 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-14 20:13:54,746 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:13:54,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:13:54 BasicIcfg [2022-04-14 20:13:54,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:13:54,749 INFO L158 Benchmark]: Toolchain (without parser) took 2032.09ms. Allocated memory is still 215.0MB. Free memory was 166.1MB in the beginning and 89.0MB in the end (delta: 77.1MB). Peak memory consumption was 77.0MB. Max. memory is 8.0GB. [2022-04-14 20:13:54,749 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory was 182.3MB in the beginning and 182.2MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:13:54,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.20ms. Allocated memory is still 215.0MB. Free memory was 165.9MB in the beginning and 189.6MB in the end (delta: -23.7MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-14 20:13:54,750 INFO L158 Benchmark]: Boogie Preprocessor took 17.39ms. Allocated memory is still 215.0MB. Free memory was 189.6MB in the beginning and 188.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:13:54,750 INFO L158 Benchmark]: RCFGBuilder took 193.06ms. Allocated memory is still 215.0MB. Free memory was 188.1MB in the beginning and 177.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:13:54,750 INFO L158 Benchmark]: IcfgTransformer took 25.18ms. Allocated memory is still 215.0MB. Free memory was 177.6MB in the beginning and 176.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:13:54,751 INFO L158 Benchmark]: TraceAbstraction took 1629.22ms. Allocated memory is still 215.0MB. Free memory was 176.0MB in the beginning and 89.0MB in the end (delta: 87.0MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. [2022-04-14 20:13:54,752 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.09ms. Allocated memory is still 215.0MB. Free memory was 182.3MB in the beginning and 182.2MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.20ms. Allocated memory is still 215.0MB. Free memory was 165.9MB in the beginning and 189.6MB in the end (delta: -23.7MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.39ms. Allocated memory is still 215.0MB. Free memory was 189.6MB in the beginning and 188.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 193.06ms. Allocated memory is still 215.0MB. Free memory was 188.1MB in the beginning and 177.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 25.18ms. Allocated memory is still 215.0MB. Free memory was 177.6MB in the beginning and 176.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1629.22ms. Allocated memory is still 215.0MB. Free memory was 176.0MB in the beginning and 89.0MB in the end (delta: 87.0MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 30 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=1, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 179 SizeOfPredicates, 3 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 20:13:54,769 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...