/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-scaling/ps3-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 20:44:32,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 20:44:32,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 20:44:32,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 20:44:32,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 20:44:32,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 20:44:32,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 20:44:32,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 20:44:32,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 20:44:32,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 20:44:32,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 20:44:32,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 20:44:32,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 20:44:32,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 20:44:32,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 20:44:32,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 20:44:32,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 20:44:32,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 20:44:32,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 20:44:32,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 20:44:32,925 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 20:44:32,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 20:44:32,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 20:44:32,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 20:44:32,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 20:44:32,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 20:44:32,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 20:44:32,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 20:44:32,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 20:44:32,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 20:44:32,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 20:44:32,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 20:44:32,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 20:44:32,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 20:44:32,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 20:44:32,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 20:44:32,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 20:44:32,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 20:44:32,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 20:44:32,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 20:44:32,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 20:44:32,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 20:44:32,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 20:44:32,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 20:44:32,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 20:44:32,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 20:44:32,948 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 20:44:32,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 20:44:32,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 20:44:32,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 20:44:32,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 20:44:32,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 20:44:32,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 20:44:32,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:44:32,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 20:44:32,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 20:44:32,951 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 20:44:32,951 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-07 20:44:33,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 20:44:33,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 20:44:33,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 20:44:33,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 20:44:33,127 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 20:44:33,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound2.c [2022-04-07 20:44:33,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4bba9286/3346db793a3349afad4d7df59eb7f107/FLAG6eae0808a [2022-04-07 20:44:33,501 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 20:44:33,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound2.c [2022-04-07 20:44:33,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4bba9286/3346db793a3349afad4d7df59eb7f107/FLAG6eae0808a [2022-04-07 20:44:33,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4bba9286/3346db793a3349afad4d7df59eb7f107 [2022-04-07 20:44:33,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 20:44:33,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 20:44:33,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 20:44:33,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 20:44:33,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 20:44:33,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:44:33" (1/1) ... [2022-04-07 20:44:33,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63fbd4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:33, skipping insertion in model container [2022-04-07 20:44:33,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:44:33" (1/1) ... [2022-04-07 20:44:33,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 20:44:33,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 20:44:34,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_unwindbound2.c[458,471] [2022-04-07 20:44:34,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:44:34,099 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 20:44:34,106 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/ps3-ll_unwindbound2.c[458,471] [2022-04-07 20:44:34,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:44:34,118 INFO L208 MainTranslator]: Completed translation [2022-04-07 20:44:34,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34 WrapperNode [2022-04-07 20:44:34,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 20:44:34,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 20:44:34,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 20:44:34,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 20:44:34,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 20:44:34,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 20:44:34,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 20:44:34,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 20:44:34,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:44:34,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:44:34,166 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 20:44:34,167 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 20:44:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 20:44:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 20:44:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 20:44:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 20:44:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 20:44:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 20:44:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 20:44:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 20:44:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 20:44:34,242 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 20:44:34,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 20:44:34,337 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 20:44:34,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 20:44:34,350 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 20:44:34,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:44:34 BoogieIcfgContainer [2022-04-07 20:44:34,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 20:44:34,352 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 20:44:34,352 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 20:44:34,355 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 20:44:34,357 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:44:34" (1/1) ... [2022-04-07 20:44:34,358 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 20:44:34,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:44:34 BasicIcfg [2022-04-07 20:44:34,376 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 20:44:34,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 20:44:34,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 20:44:34,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 20:44:34,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 08:44:33" (1/4) ... [2022-04-07 20:44:34,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743d2d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:44:34, skipping insertion in model container [2022-04-07 20:44:34,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:44:34" (2/4) ... [2022-04-07 20:44:34,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743d2d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:44:34, skipping insertion in model container [2022-04-07 20:44:34,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:44:34" (3/4) ... [2022-04-07 20:44:34,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743d2d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:44:34, skipping insertion in model container [2022-04-07 20:44:34,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:44:34" (4/4) ... [2022-04-07 20:44:34,399 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll_unwindbound2.cJordan [2022-04-07 20:44:34,402 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 20:44:34,402 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 20:44:34,426 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 20:44:34,430 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-07 20:44:34,430 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 20:44:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-07 20:44:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 20:44:34,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:44:34,445 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:44:34,445 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:44:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:44:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times [2022-04-07 20:44:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:44:34,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121402943] [2022-04-07 20:44:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:44:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:34,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 20:44:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:34,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 20:44:34,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 20:44:34,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 20:44:34,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 20:44:34,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 20:44:34,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 20:44:34,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 20:44:34,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 20:44:34,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {25#true} is VALID [2022-04-07 20:44:34,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [63] L27-3-->L27-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 20:44:34,563 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* v_main_~x~0_9 6) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 3)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {26#false} is VALID [2022-04-07 20:44:34,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [69] __VERIFIER_assertENTRY-->L10: 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] {26#false} is VALID [2022-04-07 20:44:34,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [72] L10-->L11: 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[] {26#false} is VALID [2022-04-07 20:44:34,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 20:44:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 20:44:34,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:44:34,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121402943] [2022-04-07 20:44:34,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121402943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:44:34,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:44:34,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 20:44:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775971503] [2022-04-07 20:44:34,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:44:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-07 20:44:34,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:44:34,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-07 20:44:34,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:34,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 20:44:34,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:44:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 20:44:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:44:34,600 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-07 20:44:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:34,693 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 20:44:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 20:44:34,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-07 20:44:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:44:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-07 20:44:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 20:44:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-07 20:44:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 20:44:34,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-07 20:44:34,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:34,747 INFO L225 Difference]: With dead ends: 23 [2022-04-07 20:44:34,747 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 20:44:34,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 20:44:34,753 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:44:34,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:44:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 20:44:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-07 20:44:34,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:44:34,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:34,775 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:34,775 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:34,781 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 20:44:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 20:44:34,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:34,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:34,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-07 20:44:34,782 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-07 20:44:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:34,784 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 20:44:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 20:44:34,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:34,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:34,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:44:34,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:44:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-07 20:44:34,788 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-07 20:44:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:44:34,788 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-07 20:44:34,789 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-07 20:44:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 20:44:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 20:44:34,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:44:34,791 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:44:34,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 20:44:34,794 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:44:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:44:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times [2022-04-07 20:44:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:44:34,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401871174] [2022-04-07 20:44:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:44:34,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:44:34,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361255729] [2022-04-07 20:44:34,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:34,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:44:34,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:44:34,823 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 20:44:34,824 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 20:44:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:34,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 20:44:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:34,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:44:34,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {109#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID [2022-04-07 20:44:34,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {117#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:34,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:34,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117#(<= ~counter~0 0)} {109#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:34,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {117#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:34,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#(<= ~counter~0 0)} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {117#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:34,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#(<= ~counter~0 0)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {133#(<= |main_#t~post5| 0)} is VALID [2022-04-07 20:44:34,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(<= |main_#t~post5| 0)} [66] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {110#false} is VALID [2022-04-07 20:44:34,992 INFO L272 TraceCheckUtils]: 8: Hoare triple {110#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* v_main_~x~0_9 6) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 3)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {110#false} is VALID [2022-04-07 20:44:34,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#false} [69] __VERIFIER_assertENTRY-->L10: 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] {110#false} is VALID [2022-04-07 20:44:34,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#false} [72] L10-->L11: 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[] {110#false} is VALID [2022-04-07 20:44:34,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {110#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-07 20:44:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 20:44:34,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:44:34,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:44:34,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401871174] [2022-04-07 20:44:34,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:44:34,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361255729] [2022-04-07 20:44:34,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361255729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:44:34,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:44:34,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 20:44:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553044254] [2022-04-07 20:44:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:44:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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 12 [2022-04-07 20:44:34,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:44:34,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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-07 20:44:35,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:35,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 20:44:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:44:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 20:44:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 20:44:35,009 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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-07 20:44:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:35,038 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 20:44:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 20:44:35,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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 12 [2022-04-07 20:44:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:44:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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-07 20:44:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-07 20:44:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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-07 20:44:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-07 20:44:35,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-07 20:44:35,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:35,062 INFO L225 Difference]: With dead ends: 19 [2022-04-07 20:44:35,062 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 20:44:35,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 20:44:35,065 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:44:35,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:44:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 20:44:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 20:44:35,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:44:35,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:35,070 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:35,070 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:35,072 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 20:44:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 20:44:35,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:35,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:35,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 20:44:35,073 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 20:44:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:35,075 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 20:44:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 20:44:35,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:35,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:35,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:44:35,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:44:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 20:44:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-07 20:44:35,078 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-07 20:44:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:44:35,078 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-07 20:44:35,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 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-07 20:44:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 20:44:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 20:44:35,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:44:35,079 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:44:35,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 20:44:35,294 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 20:44:35,295 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:44:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:44:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times [2022-04-07 20:44:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:44:35,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63910458] [2022-04-07 20:44:35,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:44:35,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:44:35,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557181770] [2022-04-07 20:44:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:44:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:44:35,306 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 20:44:35,307 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 20:44:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:35,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 20:44:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:35,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:44:35,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-07 20:44:35,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {224#true} is VALID [2022-04-07 20:44:35,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-07 20:44:35,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-07 20:44:35,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-07 20:44:35,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {244#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:44:35,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(and (= main_~x~0 0) (= main_~y~0 0))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {244#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:44:35,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {244#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:44:35,439 INFO L272 TraceCheckUtils]: 8: Hoare triple {244#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:44:35,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L10: 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] {258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:44:35,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} [72] L10-->L11: 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[] {225#false} is VALID [2022-04-07 20:44:35,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#false} is VALID [2022-04-07 20:44:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 20:44:35,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:44:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:44:35,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63910458] [2022-04-07 20:44:35,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:44:35,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557181770] [2022-04-07 20:44:35,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557181770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:44:35,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:44:35,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 20:44:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426166444] [2022-04-07 20:44:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:44:35,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-07 20:44:35,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:44:35,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-07 20:44:35,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:35,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:44:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:44:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:44:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 20:44:35,460 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-07 20:44:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:35,527 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 20:44:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 20:44:35,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-07 20:44:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:44:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-07 20:44:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 20:44:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-07 20:44:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 20:44:35,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-07 20:44:35,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:35,563 INFO L225 Difference]: With dead ends: 26 [2022-04-07 20:44:35,563 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 20:44:35,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 20:44:35,566 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:44:35,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:44:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 20:44:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-07 20:44:35,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:44:35,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-07 20:44:35,570 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-07 20:44:35,570 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-07 20:44:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:35,571 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-07 20:44:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-07 20:44:35,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:35,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:35,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 25 states. [2022-04-07 20:44:35,572 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 25 states. [2022-04-07 20:44:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:35,573 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-07 20:44:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-07 20:44:35,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:35,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:35,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:44:35,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:44:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-07 20:44:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-07 20:44:35,575 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-07 20:44:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:44:35,575 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-07 20:44:35,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-07 20:44:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-07 20:44:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 20:44:35,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:44:35,576 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:44:35,595 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 20:44:35,789 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 20:44:35,789 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:44:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:44:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash -832305310, now seen corresponding path program 1 times [2022-04-07 20:44:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:44:35,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866804044] [2022-04-07 20:44:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:44:35,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:44:35,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923780043] [2022-04-07 20:44:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:35,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:44:35,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:44:35,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:44:35,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 20:44:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:35,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 20:44:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:35,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:44:35,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-07 20:44:35,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:35,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:35,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {375#(<= ~counter~0 0)} {367#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:35,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {375#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:35,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#(<= ~counter~0 0)} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:35,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(<= ~counter~0 0)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(<= ~counter~0 1)} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,961 INFO L272 TraceCheckUtils]: 8: Hoare triple {391#(<= ~counter~0 1)} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= ~counter~0 1)} [69] __VERIFIER_assertENTRY-->L10: 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] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#(<= ~counter~0 1)} [73] L10-->L10-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[] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {391#(<= ~counter~0 1)} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,966 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {391#(<= ~counter~0 1)} {391#(<= ~counter~0 1)} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#(<= ~counter~0 1)} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 v_main_~y~0_5))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:35,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#(<= ~counter~0 1)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {416#(<= |main_#t~post5| 1)} is VALID [2022-04-07 20:44:35,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#(<= |main_#t~post5| 1)} [66] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {368#false} is VALID [2022-04-07 20:44:35,967 INFO L272 TraceCheckUtils]: 16: Hoare triple {368#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* v_main_~x~0_9 6) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 3)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {368#false} is VALID [2022-04-07 20:44:35,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#false} [69] __VERIFIER_assertENTRY-->L10: 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] {368#false} is VALID [2022-04-07 20:44:35,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#false} [72] L10-->L11: 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[] {368#false} is VALID [2022-04-07 20:44:35,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {368#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-07 20:44:35,970 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-07 20:44:35,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:44:36,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {368#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-07 20:44:36,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#false} [72] L10-->L11: 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[] {368#false} is VALID [2022-04-07 20:44:36,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#false} [69] __VERIFIER_assertENTRY-->L10: 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] {368#false} is VALID [2022-04-07 20:44:36,085 INFO L272 TraceCheckUtils]: 16: Hoare triple {368#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* v_main_~x~0_9 6) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 3)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {368#false} is VALID [2022-04-07 20:44:36,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#(<= |main_#t~post5| 1)} [66] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {368#false} is VALID [2022-04-07 20:44:36,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#(<= ~counter~0 1)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {416#(<= |main_#t~post5| 1)} is VALID [2022-04-07 20:44:36,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#(<= ~counter~0 1)} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 v_main_~y~0_5))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:36,087 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {367#true} {391#(<= ~counter~0 1)} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:36,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {367#true} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-07 20:44:36,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {367#true} [73] L10-->L10-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[] {367#true} is VALID [2022-04-07 20:44:36,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#true} [69] __VERIFIER_assertENTRY-->L10: 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] {367#true} is VALID [2022-04-07 20:44:36,087 INFO L272 TraceCheckUtils]: 8: Hoare triple {391#(<= ~counter~0 1)} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {367#true} is VALID [2022-04-07 20:44:36,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(<= ~counter~0 1)} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:36,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(<= ~counter~0 0)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {391#(<= ~counter~0 1)} is VALID [2022-04-07 20:44:36,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#(<= ~counter~0 0)} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:36,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {375#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:36,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {375#(<= ~counter~0 0)} {367#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:36,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:36,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {375#(<= ~counter~0 0)} is VALID [2022-04-07 20:44:36,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-07 20:44:36,091 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-07 20:44:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:44:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866804044] [2022-04-07 20:44:36,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:44:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923780043] [2022-04-07 20:44:36,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923780043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:44:36,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:44:36,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-07 20:44:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322017335] [2022-04-07 20:44:36,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:44:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-07 20:44:36,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:44:36,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:44:36,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:36,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:44:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:44:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:44:36,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 20:44:36,107 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:44:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:36,168 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-07 20:44:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 20:44:36,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-07 20:44:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:44:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:44:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-07 20:44:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:44:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-07 20:44:36,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-07 20:44:36,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:36,195 INFO L225 Difference]: With dead ends: 27 [2022-04-07 20:44:36,195 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 20:44:36,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 20:44:36,196 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:44:36,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:44:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 20:44:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 20:44:36,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:44:36,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-07 20:44:36,198 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-07 20:44:36,199 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-07 20:44:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:36,200 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-07 20:44:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 20:44:36,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:36,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:36,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 27 states. [2022-04-07 20:44:36,201 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 27 states. [2022-04-07 20:44:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:36,203 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-07 20:44:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 20:44:36,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:36,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:36,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:44:36,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:44:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-07 20:44:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-07 20:44:36,210 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-07 20:44:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:44:36,210 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-07 20:44:36,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:44:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 20:44:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 20:44:36,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:44:36,212 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:44:36,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 20:44:36,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:44:36,422 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:44:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:44:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash -831232834, now seen corresponding path program 1 times [2022-04-07 20:44:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:44:36,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500953633] [2022-04-07 20:44:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:44:36,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:44:36,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757300859] [2022-04-07 20:44:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:44:36,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:44:36,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:44:36,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:44:36,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 20:44:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:36,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 20:44:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:44:36,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:44:36,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {601#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {601#true} is VALID [2022-04-07 20:44:36,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {621#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:44:36,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#(and (= main_~x~0 0) (= main_~y~0 0))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {621#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:44:36,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {621#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:44:36,587 INFO L272 TraceCheckUtils]: 8: Hoare triple {621#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {601#true} is VALID [2022-04-07 20:44:36,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#true} [69] __VERIFIER_assertENTRY-->L10: 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] {601#true} is VALID [2022-04-07 20:44:36,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {601#true} [73] L10-->L10-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[] {601#true} is VALID [2022-04-07 20:44:36,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#true} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,589 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {601#true} {621#(and (= main_~x~0 0) (= main_~y~0 0))} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {621#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:44:36,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#(and (= main_~x~0 0) (= main_~y~0 0))} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 v_main_~y~0_5))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {646#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-07 20:44:36,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {646#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-07 20:44:36,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {646#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID [2022-04-07 20:44:36,594 INFO L272 TraceCheckUtils]: 16: Hoare triple {646#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:44:36,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L10: 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] {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:44:36,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} [72] L10-->L11: 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[] {602#false} is VALID [2022-04-07 20:44:36,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {602#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#false} is VALID [2022-04-07 20:44:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 20:44:36,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:44:36,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {602#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#false} is VALID [2022-04-07 20:44:36,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} [72] L10-->L11: 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[] {602#false} is VALID [2022-04-07 20:44:36,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L10: 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] {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:44:36,730 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:44:36,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:44:36,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:44:36,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 v_main_~y~0_5))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:44:36,748 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {601#true} {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:44:36,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#true} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {601#true} [73] L10-->L10-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[] {601#true} is VALID [2022-04-07 20:44:36,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#true} [69] __VERIFIER_assertENTRY-->L10: 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] {601#true} is VALID [2022-04-07 20:44:36,749 INFO L272 TraceCheckUtils]: 8: Hoare triple {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {601#true} is VALID [2022-04-07 20:44:36,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:44:36,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:44:36,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {676#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:44:36,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {601#true} is VALID [2022-04-07 20:44:36,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {601#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-07 20:44:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 20:44:36,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:44:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500953633] [2022-04-07 20:44:36,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:44:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757300859] [2022-04-07 20:44:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757300859] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 20:44:36,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 20:44:36,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 20:44:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974918195] [2022-04-07 20:44:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:44:36,753 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, (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 20 [2022-04-07 20:44:36,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:44:36,753 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, (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-07 20:44:36,897 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-07 20:44:36,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:44:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:44:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:44:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 20:44:36,898 INFO L87 Difference]: Start difference. First operand 27 states and 29 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, (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-07 20:44:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:36,956 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-07 20:44:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 20:44:36,956 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, (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 20 [2022-04-07 20:44:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:44:36,957 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, (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-07 20:44:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-07 20:44:36,957 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, (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-07 20:44:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-07 20:44:36,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-04-07 20:44:38,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 20:44:38,983 INFO L225 Difference]: With dead ends: 25 [2022-04-07 20:44:38,983 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 20:44:38,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 20:44:38,984 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:44:38,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:44:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 20:44:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 20:44:38,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:44:38,985 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 20:44:38,985 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 20:44:38,985 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 20:44:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:38,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 20:44:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:44:38,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:38,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:38,985 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 20:44:38,985 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 20:44:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:44:38,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 20:44:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:44:38,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:38,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:44:38,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:44:38,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:44:38,986 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 20:44:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 20:44:38,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-07 20:44:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:44:38,986 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 20:44:38,986 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, (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-07 20:44:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:44:38,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:44:38,988 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 20:44:39,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 20:44:39,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:44:39,193 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 20:44:39,194 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 20:44:39,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:44:39 BasicIcfg [2022-04-07 20:44:39,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 20:44:39,196 INFO L158 Benchmark]: Toolchain (without parser) took 5238.84ms. Allocated memory was 189.8MB in the beginning and 281.0MB in the end (delta: 91.2MB). Free memory was 135.1MB in the beginning and 159.3MB in the end (delta: -24.3MB). Peak memory consumption was 67.2MB. Max. memory is 8.0GB. [2022-04-07 20:44:39,196 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 20:44:39,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.53ms. Allocated memory is still 189.8MB. Free memory was 134.9MB in the beginning and 164.7MB in the end (delta: -29.8MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-04-07 20:44:39,197 INFO L158 Benchmark]: Boogie Preprocessor took 16.63ms. Allocated memory is still 189.8MB. Free memory was 164.7MB in the beginning and 163.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 20:44:39,197 INFO L158 Benchmark]: RCFGBuilder took 215.66ms. Allocated memory is still 189.8MB. Free memory was 163.2MB in the beginning and 152.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 20:44:39,197 INFO L158 Benchmark]: IcfgTransformer took 23.84ms. Allocated memory is still 189.8MB. Free memory was 152.2MB in the beginning and 150.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 20:44:39,197 INFO L158 Benchmark]: TraceAbstraction took 4814.04ms. Allocated memory was 189.8MB in the beginning and 281.0MB in the end (delta: 91.2MB). Free memory was 150.1MB in the beginning and 159.3MB in the end (delta: -9.2MB). Peak memory consumption was 82.5MB. Max. memory is 8.0GB. [2022-04-07 20:44:39,198 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 189.8MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 159.53ms. Allocated memory is still 189.8MB. Free memory was 134.9MB in the beginning and 164.7MB in the end (delta: -29.8MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.63ms. Allocated memory is still 189.8MB. Free memory was 164.7MB in the beginning and 163.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.66ms. Allocated memory is still 189.8MB. Free memory was 163.2MB in the beginning and 152.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 23.84ms. Allocated memory is still 189.8MB. Free memory was 152.2MB in the beginning and 150.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4814.04ms. Allocated memory was 189.8MB in the beginning and 281.0MB in the end (delta: 91.2MB). Free memory was 150.1MB in the beginning and 159.3MB in the end (delta: -9.2MB). Peak memory consumption was 82.5MB. 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: 12]: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 87 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 376 SizeOfPredicates, 5 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 11/18 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-07 20:44:39,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...