/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/geo3-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 21:43:16,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 21:43:16,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 21:43:16,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 21:43:16,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 21:43:16,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 21:43:16,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 21:43:16,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 21:43:16,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 21:43:16,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 21:43:16,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 21:43:16,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 21:43:16,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 21:43:16,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 21:43:16,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 21:43:16,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 21:43:16,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 21:43:16,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 21:43:16,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 21:43:16,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 21:43:16,941 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 21:43:16,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 21:43:16,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 21:43:16,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 21:43:16,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 21:43:16,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 21:43:16,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 21:43:16,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 21:43:16,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 21:43:16,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 21:43:16,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 21:43:16,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 21:43:16,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 21:43:16,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 21:43:16,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 21:43:16,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 21:43:16,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 21:43:16,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 21:43:16,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 21:43:16,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 21:43:16,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 21:43:16,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 21:43:16,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 21:43:16,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 21:43:16,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 21:43:16,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 21:43:16,977 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 21:43:16,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 21:43:16,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 21:43:16,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 21:43:16,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 21:43:16,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 21:43:16,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 21:43:16,979 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 21:43:16,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 21:43:16,979 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 21:43:16,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 21:43:16,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 21:43:16,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 21:43:16,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 21:43:16,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 21:43:16,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:43:16,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 21:43:16,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 21:43:16,981 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 21:43:16,981 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 21:43:17,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 21:43:17,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 21:43:17,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 21:43:17,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 21:43:17,226 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 21:43:17,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound20.c [2022-04-14 21:43:17,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12cb97bed/975d78cdba6148f28f3855bcace2bc84/FLAGd9fcb1a80 [2022-04-14 21:43:17,633 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 21:43:17,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound20.c [2022-04-14 21:43:17,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12cb97bed/975d78cdba6148f28f3855bcace2bc84/FLAGd9fcb1a80 [2022-04-14 21:43:17,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12cb97bed/975d78cdba6148f28f3855bcace2bc84 [2022-04-14 21:43:17,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 21:43:17,651 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 21:43:17,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 21:43:17,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 21:43:17,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 21:43:17,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d024bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17, skipping insertion in model container [2022-04-14 21:43:17,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 21:43:17,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 21:43:17,799 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/geo3-ll_unwindbound20.c[525,538] [2022-04-14 21:43:17,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:43:17,829 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 21:43:17,838 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/geo3-ll_unwindbound20.c[525,538] [2022-04-14 21:43:17,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:43:17,853 INFO L208 MainTranslator]: Completed translation [2022-04-14 21:43:17,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17 WrapperNode [2022-04-14 21:43:17,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 21:43:17,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 21:43:17,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 21:43:17,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 21:43:17,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 21:43:17,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 21:43:17,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 21:43:17,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 21:43:17,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (1/1) ... [2022-04-14 21:43:17,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:43:17,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:17,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 21:43:17,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 21:43:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 21:43:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 21:43:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 21:43:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 21:43:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 21:43:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 21:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 21:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 21:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 21:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 21:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 21:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 21:43:18,006 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 21:43:18,007 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 21:43:18,145 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 21:43:18,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 21:43:18,151 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 21:43:18,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:43:18 BoogieIcfgContainer [2022-04-14 21:43:18,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 21:43:18,153 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 21:43:18,153 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 21:43:18,154 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 21:43:18,157 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:43:18" (1/1) ... [2022-04-14 21:43:18,158 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 21:43:18,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:43:18 BasicIcfg [2022-04-14 21:43:18,182 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 21:43:18,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 21:43:18,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 21:43:18,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 21:43:18,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 09:43:17" (1/4) ... [2022-04-14 21:43:18,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377d7f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:43:18, skipping insertion in model container [2022-04-14 21:43:18,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:17" (2/4) ... [2022-04-14 21:43:18,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377d7f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:43:18, skipping insertion in model container [2022-04-14 21:43:18,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:43:18" (3/4) ... [2022-04-14 21:43:18,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377d7f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:43:18, skipping insertion in model container [2022-04-14 21:43:18,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:43:18" (4/4) ... [2022-04-14 21:43:18,189 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound20.cJordan [2022-04-14 21:43:18,193 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 21:43:18,193 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 21:43:18,228 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 21:43:18,234 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 21:43:18,234 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 21:43:18,248 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-14 21:43:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 21:43:18,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:18,254 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:18,254 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times [2022-04-14 21:43:18,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:18,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505801795] [2022-04-14 21:43:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:18,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:18,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:43:18,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176015457] [2022-04-14 21:43:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:18,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:18,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:18,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:43:18,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 21:43:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:18,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-14 21:43:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:18,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:18,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 21:43:18,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#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| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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-14 21:43:18,532 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-14 21:43:18,533 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-14 21:43:18,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 21:43:18,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {25#true} is VALID [2022-04-14 21:43:18,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [63] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 21:43:18,535 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {26#false} is VALID [2022-04-14 21:43:18,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-14 21:43:18,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 21:43:18,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 21:43:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:18,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:43:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505801795] [2022-04-14 21:43:18,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:18,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176015457] [2022-04-14 21:43:18,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176015457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:18,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:18,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-14 21:43:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937883928] [2022-04-14 21:43:18,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:18,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 21:43:18,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:18,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:43:18,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:18,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-14 21:43:18,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:18,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-14 21:43:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 21:43:18,605 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:43:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:18,653 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-14 21:43:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-14 21:43:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 21:43:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:43:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-04-14 21:43:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:43:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-04-14 21:43:18,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 26 transitions. [2022-04-14 21:43:18,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:18,711 INFO L225 Difference]: With dead ends: 22 [2022-04-14 21:43:18,711 INFO L226 Difference]: Without dead ends: 17 [2022-04-14 21:43:18,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 21:43:18,717 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:18,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:43:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-14 21:43:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-14 21:43:18,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:18,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 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-14 21:43:18,744 INFO L74 IsIncluded]: Start isIncluded. First operand 17 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-14 21:43:18,745 INFO L87 Difference]: Start difference. First operand 17 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-14 21:43:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:18,755 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-14 21:43:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 21:43:18,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:18,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:18,757 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 17 states. [2022-04-14 21:43:18,757 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 17 states. [2022-04-14 21:43:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:18,761 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-14 21:43:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 21:43:18,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:18,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:18,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:18,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:18,764 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-14 21:43:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-14 21:43:18,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-14 21:43:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:18,769 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-14 21:43:18,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:43:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 21:43:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 21:43:18,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:18,770 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:18,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 21:43:18,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-14 21:43:18,971 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times [2022-04-14 21:43:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:18,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390507835] [2022-04-14 21:43:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:18,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:43:18,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561591790] [2022-04-14 21:43:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:18,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:18,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:43:19,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 21:43:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:19,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 21:43:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:19,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:19,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-14 21:43:19,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#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| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {140#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:19,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:19,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#(<= ~counter~0 0)} {132#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:19,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:19,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#(<= ~counter~0 0)} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {140#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:19,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(<= ~counter~0 0)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {156#(<= |main_#t~post7| 0)} is VALID [2022-04-14 21:43:19,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {156#(<= |main_#t~post7| 0)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 20)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {133#false} is VALID [2022-04-14 21:43:19,229 INFO L272 TraceCheckUtils]: 8: Hoare triple {133#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {133#false} is VALID [2022-04-14 21:43:19,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {133#false} is VALID [2022-04-14 21:43:19,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {133#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-14 21:43:19,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-14 21:43:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:19,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:43:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:19,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390507835] [2022-04-14 21:43:19,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:19,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561591790] [2022-04-14 21:43:19,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561591790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:19,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:19,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 21:43:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15762615] [2022-04-14 21:43:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:19,233 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-14 21:43:19,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:19,234 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-14 21:43:19,249 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-14 21:43:19,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 21:43:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 21:43:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:43:19,251 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-14 21:43:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:19,296 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 21:43:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 21:43:19,296 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-14 21:43:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:19,297 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-14 21:43:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-14 21:43:19,303 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-14 21:43:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-14 21:43:19,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-14 21:43:19,333 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-14 21:43:19,334 INFO L225 Difference]: With dead ends: 19 [2022-04-14 21:43:19,334 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 21:43:19,335 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-14 21:43:19,337 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-14 21:43:19,338 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-14 21:43:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 21:43:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-14 21:43:19,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:19,343 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-14 21:43:19,344 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-14 21:43:19,345 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-14 21:43:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:19,347 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 21:43:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 21:43:19,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:19,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:19,349 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-14 21:43:19,349 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-14 21:43:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:19,352 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 21:43:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 21:43:19,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:19,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:19,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:19,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:19,353 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-14 21:43:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-14 21:43:19,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-14 21:43:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:19,357 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-14 21:43:19,357 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-14 21:43:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 21:43:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 21:43:19,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:19,358 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:19,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 21:43:19,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-14 21:43:19,581 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times [2022-04-14 21:43:19,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:19,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173787136] [2022-04-14 21:43:19,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:19,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:43:19,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331016823] [2022-04-14 21:43:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:19,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:19,602 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-14 21:43:19,603 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-14 21:43:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:19,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 21:43:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:19,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:19,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-14 21:43:19,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#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| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {247#true} is VALID [2022-04-14 21:43:19,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-14 21:43:19,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-14 21:43:19,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-14 21:43:19,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {267#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:19,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {267#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:19,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 20) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {267#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:19,821 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:43:19,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:43:19,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {281#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {248#false} is VALID [2022-04-14 21:43:19,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {248#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {248#false} is VALID [2022-04-14 21:43:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:19,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:43:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173787136] [2022-04-14 21:43:19,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331016823] [2022-04-14 21:43:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331016823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:19,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:19,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:43:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434822041] [2022-04-14 21:43:19,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:19,824 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-14 21:43:19,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:19,824 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-14 21:43:19,835 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-14 21:43:19,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:43:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:43:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:43:19,836 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-14 21:43:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:19,948 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-14 21:43:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:43:19,948 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-14 21:43:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:19,949 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-14 21:43:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-14 21:43:19,952 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-14 21:43:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-14 21:43:19,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-14 21:43:19,982 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-14 21:43:19,983 INFO L225 Difference]: With dead ends: 26 [2022-04-14 21:43:19,983 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 21:43:19,984 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-14 21:43:19,985 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-14 21:43:19,986 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-14 21:43:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 21:43:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 21:43:19,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:19,989 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-14 21:43:19,989 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-14 21:43:19,990 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-14 21:43:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:19,991 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 21:43:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 21:43:19,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:19,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:19,992 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-14 21:43:19,992 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-14 21:43:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:19,994 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 21:43:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 21:43:19,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:19,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:19,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:19,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:19,995 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-14 21:43:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-14 21:43:19,996 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-14 21:43:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:19,997 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-14 21:43:19,997 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-14 21:43:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 21:43:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 21:43:19,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:19,998 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-14 21:43:20,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 21:43:20,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:20,204 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash -832305310, now seen corresponding path program 1 times [2022-04-14 21:43:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:20,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282550622] [2022-04-14 21:43:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:20,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:20,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:43:20,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034274892] [2022-04-14 21:43:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:20,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:20,221 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-14 21:43:20,242 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-14 21:43:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:20,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:43:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:20,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:20,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-14 21:43:20,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#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| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {398#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:20,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:20,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#(<= ~counter~0 0)} {390#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:20,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:20,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#(<= ~counter~0 0)} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {398#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:20,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(<= ~counter~0 0)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {414#(<= ~counter~0 1)} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 20) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,434 INFO L272 TraceCheckUtils]: 8: Hoare triple {414#(<= ~counter~0 1)} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {414#(<= ~counter~0 1)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {414#(<= ~counter~0 1)} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {414#(<= ~counter~0 1)} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,436 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {414#(<= ~counter~0 1)} {414#(<= ~counter~0 1)} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {414#(<= ~counter~0 1)} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~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_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {414#(<= ~counter~0 1)} is VALID [2022-04-14 21:43:20,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {414#(<= ~counter~0 1)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {439#(<= |main_#t~post7| 1)} is VALID [2022-04-14 21:43:20,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#(<= |main_#t~post7| 1)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 20)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {391#false} is VALID [2022-04-14 21:43:20,441 INFO L272 TraceCheckUtils]: 16: Hoare triple {391#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {391#false} is VALID [2022-04-14 21:43:20,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {391#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {391#false} is VALID [2022-04-14 21:43:20,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {391#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-14 21:43:20,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {391#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-14 21:43:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:20,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:43:20,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {391#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-14 21:43:20,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {391#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-14 21:43:20,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {391#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {391#false} is VALID [2022-04-14 21:43:20,606 INFO L272 TraceCheckUtils]: 16: Hoare triple {391#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {391#false} is VALID [2022-04-14 21:43:20,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {467#(< |main_#t~post7| 20)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 20)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {391#false} is VALID [2022-04-14 21:43:20,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#(< ~counter~0 20)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {467#(< |main_#t~post7| 20)} is VALID [2022-04-14 21:43:20,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#(< ~counter~0 20)} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~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_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {471#(< ~counter~0 20)} is VALID [2022-04-14 21:43:20,609 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {390#true} {471#(< ~counter~0 20)} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {471#(< ~counter~0 20)} is VALID [2022-04-14 21:43:20,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#true} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-14 21:43:20,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {390#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-14 21:43:20,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {390#true} is VALID [2022-04-14 21:43:20,609 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(< ~counter~0 20)} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {390#true} is VALID [2022-04-14 21:43:20,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(< ~counter~0 20)} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 20) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {471#(< ~counter~0 20)} is VALID [2022-04-14 21:43:20,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {496#(< ~counter~0 19)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {471#(< ~counter~0 20)} is VALID [2022-04-14 21:43:20,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {496#(< ~counter~0 19)} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {496#(< ~counter~0 19)} is VALID [2022-04-14 21:43:20,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {496#(< ~counter~0 19)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {496#(< ~counter~0 19)} is VALID [2022-04-14 21:43:20,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {496#(< ~counter~0 19)} {390#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {496#(< ~counter~0 19)} is VALID [2022-04-14 21:43:20,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {496#(< ~counter~0 19)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {496#(< ~counter~0 19)} is VALID [2022-04-14 21:43:20,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#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| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {496#(< ~counter~0 19)} is VALID [2022-04-14 21:43:20,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-14 21:43:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:20,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:20,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282550622] [2022-04-14 21:43:20,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:20,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034274892] [2022-04-14 21:43:20,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034274892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 21:43:20,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 21:43:20,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 21:43:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766820702] [2022-04-14 21:43:20,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 21:43:20,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-14 21:43:20,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:20,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 21:43:20,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:20,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 21:43:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 21:43:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 21:43:20,644 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 21:43:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:20,798 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-14 21:43:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 21:43:20,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-14 21:43:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 21:43:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-14 21:43:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 21:43:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-14 21:43:20,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-14 21:43:20,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:20,857 INFO L225 Difference]: With dead ends: 49 [2022-04-14 21:43:20,857 INFO L226 Difference]: Without dead ends: 49 [2022-04-14 21:43:20,858 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-14 21:43:20,858 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:20,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:43:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-14 21:43:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-04-14 21:43:20,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:20,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 21:43:20,863 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 21:43:20,864 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 21:43:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:20,867 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-14 21:43:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-14 21:43:20,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:20,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:20,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-14 21:43:20,868 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-14 21:43:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:20,871 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-14 21:43:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-14 21:43:20,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:20,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:20,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:20,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 21:43:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-14 21:43:20,874 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-04-14 21:43:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:20,874 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-14 21:43:20,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 21:43:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 21:43:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 21:43:20,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:20,875 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:20,903 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-14 21:43:21,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:21,098 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash -831232834, now seen corresponding path program 1 times [2022-04-14 21:43:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000412303] [2022-04-14 21:43:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:21,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:43:21,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39958209] [2022-04-14 21:43:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:21,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:21,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:21,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:43:21,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 21:43:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:21,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-14 21:43:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:21,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:21,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:21,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {715#true} is VALID [2022-04-14 21:43:21,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:21,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:21,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:21,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:21,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:21,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 20) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:21,464 INFO L272 TraceCheckUtils]: 8: Hoare triple {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {715#true} is VALID [2022-04-14 21:43:21,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:43:21,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:43:21,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:43:21,466 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:21,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~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_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {762#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:21,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {762#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {762#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:21,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {762#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 20) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {762#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 21:43:21,470 INFO L272 TraceCheckUtils]: 16: Hoare triple {762#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {772#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:43:21,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {772#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {776#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:43:21,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {776#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {716#false} is VALID [2022-04-14 21:43:21,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#false} is VALID [2022-04-14 21:43:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:21,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:43:33,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#false} is VALID [2022-04-14 21:43:33,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {776#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {716#false} is VALID [2022-04-14 21:43:33,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {772#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {776#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:43:33,215 INFO L272 TraceCheckUtils]: 16: Hoare triple {792#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {772#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:43:33,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 20) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {792#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-14 21:43:33,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {792#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-14 21:43:33,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {802#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~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_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {792#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-14 21:43:33,277 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} {715#true} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {802#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-14 21:43:33,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:43:33,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:43:33,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {815#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 21:43:33,278 INFO L272 TraceCheckUtils]: 8: Hoare triple {715#true} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {715#true} is VALID [2022-04-14 21:43:33,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 20) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {715#true} is VALID [2022-04-14 21:43:33,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#true} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {715#true} is VALID [2022-04-14 21:43:33,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {715#true} is VALID [2022-04-14 21:43:33,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:33,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:33,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:33,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {715#true} is VALID [2022-04-14 21:43:33,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-14 21:43:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:33,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000412303] [2022-04-14 21:43:33,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:33,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39958209] [2022-04-14 21:43:33,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39958209] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 21:43:33,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 21:43:33,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-14 21:43:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621322805] [2022-04-14 21:43:33,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 21:43:33,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-14 21:43:33,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:33,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:33,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:33,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 21:43:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 21:43:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-14 21:43:33,412 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:34,711 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-14 21:43:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 21:43:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-14 21:43:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-14 21:43:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-14 21:43:34,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-14 21:43:36,665 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-14 21:43:36,665 INFO L225 Difference]: With dead ends: 43 [2022-04-14 21:43:36,665 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 21:43:36,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-14 21:43:36,666 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:36,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 90 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 21:43:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 21:43:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 21:43:36,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:36,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 21:43:36,667 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 21:43:36,667 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 21:43:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:36,667 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 21:43:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:43:36,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:36,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:36,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 21:43:36,668 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 21:43:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:36,668 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 21:43:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:43:36,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:36,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:36,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:36,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 21:43:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 21:43:36,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-14 21:43:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:36,669 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 21:43:36,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:43:36,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:36,671 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 21:43:36,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 21:43:36,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:36,874 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-14 21:43:36,875 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 21:43:36,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:43:36 BasicIcfg [2022-04-14 21:43:36,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 21:43:36,878 INFO L158 Benchmark]: Toolchain (without parser) took 19227.24ms. Allocated memory was 172.0MB in the beginning and 215.0MB in the end (delta: 43.0MB). Free memory was 122.7MB in the beginning and 123.3MB in the end (delta: -574.2kB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-04-14 21:43:36,878 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 21:43:36,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.26ms. Allocated memory is still 172.0MB. Free memory was 122.6MB in the beginning and 147.2MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 21:43:36,879 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 172.0MB. Free memory was 147.2MB in the beginning and 145.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 21:43:36,879 INFO L158 Benchmark]: RCFGBuilder took 265.69ms. Allocated memory is still 172.0MB. Free memory was 145.6MB in the beginning and 134.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 21:43:36,879 INFO L158 Benchmark]: IcfgTransformer took 29.02ms. Allocated memory is still 172.0MB. Free memory was 134.6MB in the beginning and 133.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 21:43:36,880 INFO L158 Benchmark]: TraceAbstraction took 18693.94ms. Allocated memory was 172.0MB in the beginning and 215.0MB in the end (delta: 43.0MB). Free memory was 132.5MB in the beginning and 123.3MB in the end (delta: 9.2MB). Peak memory consumption was 52.8MB. Max. memory is 8.0GB. [2022-04-14 21:43:36,881 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.11ms. Allocated memory is still 172.0MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.26ms. Allocated memory is still 172.0MB. Free memory was 122.6MB in the beginning and 147.2MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 172.0MB. Free memory was 147.2MB in the beginning and 145.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.69ms. Allocated memory is still 172.0MB. Free memory was 145.6MB in the beginning and 134.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 29.02ms. Allocated memory is still 172.0MB. Free memory was 134.6MB in the beginning and 133.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 18693.94ms. Allocated memory was 172.0MB in the beginning and 215.0MB in the end (delta: 43.0MB). Free memory was 132.5MB in the beginning and 123.3MB in the end (delta: 9.2MB). Peak memory consumption was 52.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 93 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 28, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 372 SizeOfPredicates, 6 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 9/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-14 21:43:36,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...