/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 20:47:41,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 20:47:41,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 20:47:41,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 20:47:41,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 20:47:41,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 20:47:41,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 20:47:41,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 20:47:41,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 20:47:41,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 20:47:41,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 20:47:41,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 20:47:41,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 20:47:41,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 20:47:41,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 20:47:41,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 20:47:41,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 20:47:41,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 20:47:41,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 20:47:41,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 20:47:41,910 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 20:47:41,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 20:47:41,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 20:47:41,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 20:47:41,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 20:47:41,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 20:47:41,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 20:47:41,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 20:47:41,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 20:47:41,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 20:47:41,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 20:47:41,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 20:47:41,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 20:47:41,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 20:47:41,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 20:47:41,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 20:47:41,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 20:47:41,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 20:47:41,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 20:47:41,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 20:47:41,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 20:47:41,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 20:47:41,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 20:47:41,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 20:47:41,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 20:47:41,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 20:47:41,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 20:47:41,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 20:47:41,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 20:47:41,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 20:47:41,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 20:47:41,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 20:47:41,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 20:47:41,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 20:47:41,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 20:47:41,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 20:47:41,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 20:47:41,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 20:47:41,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 20:47:41,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 20:47:41,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 20:47:41,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:47:41,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 20:47:41,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 20:47:41,934 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 20:47:41,935 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 20:47:42,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 20:47:42,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 20:47:42,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 20:47:42,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 20:47:42,107 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 20:47:42,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound50.c [2022-04-07 20:47:42,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049107b4b/e2b9f3792efc4e5cabcaeca81e8dfee9/FLAG7ce7aec3b [2022-04-07 20:47:42,504 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 20:47:42,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound50.c [2022-04-07 20:47:42,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049107b4b/e2b9f3792efc4e5cabcaeca81e8dfee9/FLAG7ce7aec3b [2022-04-07 20:47:42,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049107b4b/e2b9f3792efc4e5cabcaeca81e8dfee9 [2022-04-07 20:47:42,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 20:47:42,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 20:47:42,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 20:47:42,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 20:47:42,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 20:47:42,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cde434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42, skipping insertion in model container [2022-04-07 20:47:42,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 20:47:42,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 20:47:42,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound50.c[458,471] [2022-04-07 20:47:42,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:47:42,712 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 20:47:42,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound50.c[458,471] [2022-04-07 20:47:42,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:47:42,734 INFO L208 MainTranslator]: Completed translation [2022-04-07 20:47:42,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42 WrapperNode [2022-04-07 20:47:42,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 20:47:42,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 20:47:42,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 20:47:42,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 20:47:42,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 20:47:42,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 20:47:42,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 20:47:42,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 20:47:42,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:47:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:47:42,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 20:47:42,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 20:47:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 20:47:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 20:47:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 20:47:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 20:47:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 20:47:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 20:47:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 20:47:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 20:47:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 20:47:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 20:47:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 20:47:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 20:47:42,856 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 20:47:42,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 20:47:42,969 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 20:47:42,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 20:47:42,981 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 20:47:42,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:47:42 BoogieIcfgContainer [2022-04-07 20:47:42,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 20:47:42,983 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 20:47:42,983 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 20:47:42,984 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 20:47:42,989 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:47:42" (1/1) ... [2022-04-07 20:47:42,990 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 20:47:43,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:47:43 BasicIcfg [2022-04-07 20:47:43,011 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 20:47:43,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 20:47:43,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 20:47:43,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 20:47:43,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 08:47:42" (1/4) ... [2022-04-07 20:47:43,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6619d6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:47:43, skipping insertion in model container [2022-04-07 20:47:43,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:47:42" (2/4) ... [2022-04-07 20:47:43,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6619d6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:47:43, skipping insertion in model container [2022-04-07 20:47:43,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:47:42" (3/4) ... [2022-04-07 20:47:43,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6619d6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:47:43, skipping insertion in model container [2022-04-07 20:47:43,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:47:43" (4/4) ... [2022-04-07 20:47:43,020 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll_valuebound50.cJordan [2022-04-07 20:47:43,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 20:47:43,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 20:47:43,057 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 20:47:43,061 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 20:47:43,061 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 20:47:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 20:47:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 20:47:43,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:47:43,086 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:47:43,087 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:47:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:47:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 409333534, now seen corresponding path program 1 times [2022-04-07 20:47:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:47:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330777858] [2022-04-07 20:47:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:47:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:47:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:47:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 20:47:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:47:43,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-07 20:47:43,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 20:47:43,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 20:47:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 20:47:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:47:43,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30#true} is VALID [2022-04-07 20:47:43,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [72] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 20:47:43,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 20:47:43,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {31#false} is VALID [2022-04-07 20:47:43,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 20:47:43,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-07 20:47:43,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 20:47:43,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 20:47:43,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 20:47:43,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} [64] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {30#true} is VALID [2022-04-07 20:47:43,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {30#true} is VALID [2022-04-07 20:47:43,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30#true} is VALID [2022-04-07 20:47:43,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} [72] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 20:47:43,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 20:47:43,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {31#false} is VALID [2022-04-07 20:47:43,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {31#false} is VALID [2022-04-07 20:47:43,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} [69] L27-2-->L27-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 20:47:43,269 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} [74] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 2) v_main_~y~0_8))) (* (- 1) (* v_main_~y~0_8 (* v_main_~y~0_8 3))) (* v_main_~x~0_8 6)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {31#false} is VALID [2022-04-07 20:47:43,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} [78] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {31#false} is VALID [2022-04-07 20:47:43,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} [82] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 20:47:43,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 20:47:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 20:47:43,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:47:43,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330777858] [2022-04-07 20:47:43,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330777858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:47:43,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:47:43,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 20:47:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717604266] [2022-04-07 20:47:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:47:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 20:47:43,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:47:43,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:47:43,293 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 20:47:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:47:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 20:47:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:47:43,307 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:43,360 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-07 20:47:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 20:47:43,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 20:47:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:47:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-07 20:47:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-07 20:47:43,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-07 20:47:43,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:47:43,420 INFO L225 Difference]: With dead ends: 27 [2022-04-07 20:47:43,420 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 20:47:43,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:47:43,427 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:47:43,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:47:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 20:47:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-07 20:47:43,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:47:43,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 20:47:43,446 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 20:47:43,446 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 20:47:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:43,449 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-07 20:47:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-07 20:47:43,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:47:43,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:47:43,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states. [2022-04-07 20:47:43,450 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states. [2022-04-07 20:47:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:43,451 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-07 20:47:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-07 20:47:43,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:47:43,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:47:43,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:47:43,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:47:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 20:47:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-07 20:47:43,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-07 20:47:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:47:43,454 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-07 20:47:43,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-07 20:47:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 20:47:43,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:47:43,455 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:47:43,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 20:47:43,456 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:47:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:47:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1396244096, now seen corresponding path program 1 times [2022-04-07 20:47:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:47:43,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338717178] [2022-04-07 20:47:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:47:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:47:43,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:47:43,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152345335] [2022-04-07 20:47:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:47:43,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:47:43,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:47:43,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:47:43,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 20:47:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:47:43,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 20:47:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:47:43,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:47:43,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-07 20:47:43,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {135#true} is VALID [2022-04-07 20:47:43,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-07 20:47:43,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-07 20:47:43,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-07 20:47:43,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} [64] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {135#true} is VALID [2022-04-07 20:47:43,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {135#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {135#true} is VALID [2022-04-07 20:47:43,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {135#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {135#true} is VALID [2022-04-07 20:47:43,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {135#true} [73] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-07 20:47:43,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#true} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-07 20:47:43,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {135#true} {135#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {135#true} is VALID [2022-04-07 20:47:43,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#true} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {173#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:47:43,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#(and (= main_~x~0 0) (= main_~y~0 0))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:47:43,694 INFO L272 TraceCheckUtils]: 13: Hoare triple {173#(and (= main_~x~0 0) (= main_~y~0 0))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (* v_main_~y~0_7 (* v_main_~y~0_7 (* v_main_~y~0_7 2))) (- 1)) (* (- 1) (* v_main_~y~0_7 (* v_main_~y~0_7 3))) (* v_main_~x~0_7 6) (* (- 1) v_main_~y~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {180#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:47:43,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {180#(<= 1 |__VERIFIER_assert_#in~cond|)} [78] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {184#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:47:43,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {184#(<= 1 __VERIFIER_assert_~cond)} [82] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {136#false} is VALID [2022-04-07 20:47:43,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {136#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#false} is VALID [2022-04-07 20:47:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 20:47:43,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:47:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:47:43,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338717178] [2022-04-07 20:47:43,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:47:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152345335] [2022-04-07 20:47:43,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152345335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:47:43,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:47:43,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 20:47:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291583342] [2022-04-07 20:47:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:47:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 20:47:43,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:47:43,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:47:43,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:47:43,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:47:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:47:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 20:47:43,716 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:43,818 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-07 20:47:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 20:47:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 20:47:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:47:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-07 20:47:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-07 20:47:43,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-07 20:47:43,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:47:43,852 INFO L225 Difference]: With dead ends: 30 [2022-04-07 20:47:43,852 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 20:47:43,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 20:47:43,854 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:47:43,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:47:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 20:47:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 20:47:43,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:47:43,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:47:43,860 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:47:43,860 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:47:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:43,862 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-07 20:47:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-07 20:47:43,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:47:43,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:47:43,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-07 20:47:43,864 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-07 20:47:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:43,866 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-07 20:47:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-07 20:47:43,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:47:43,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:47:43,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:47:43,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:47:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:47:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-07 20:47:43,870 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2022-04-07 20:47:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:47:43,870 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-07 20:47:43,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 20:47:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-07 20:47:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 20:47:43,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:47:43,871 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:47:43,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 20:47:44,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:47:44,082 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:47:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:47:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 279144821, now seen corresponding path program 1 times [2022-04-07 20:47:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:47:44,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697374660] [2022-04-07 20:47:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:47:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:47:44,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:47:44,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220229255] [2022-04-07 20:47:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:47:44,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:47:44,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:47:44,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:47:44,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 20:47:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:47:44,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 20:47:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:47:44,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:47:44,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {309#true} is VALID [2022-04-07 20:47:44,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} [64] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {309#true} is VALID [2022-04-07 20:47:44,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {309#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-07 20:47:44,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {309#true} is VALID [2022-04-07 20:47:44,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} [73] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {309#true} {309#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-07 20:47:44,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#true} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:47:44,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:47:44,285 INFO L272 TraceCheckUtils]: 13: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (* v_main_~y~0_7 (* v_main_~y~0_7 (* v_main_~y~0_7 2))) (- 1)) (* (- 1) (* v_main_~y~0_7 (* v_main_~y~0_7 3))) (* v_main_~x~0_7 6) (* (- 1) v_main_~y~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {309#true} is VALID [2022-04-07 20:47:44,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {309#true} [78] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {309#true} is VALID [2022-04-07 20:47:44,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {309#true} [83] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {309#true} [86] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,287 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {309#true} {347#(and (= main_~x~0 0) (= main_~y~0 0))} [90] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (* v_main_~y~0_7 (* v_main_~y~0_7 (* v_main_~y~0_7 2))) (- 1)) (* (- 1) (* v_main_~y~0_7 (* v_main_~y~0_7 3))) (* v_main_~x~0_7 6) (* (- 1) v_main_~y~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 20:47:44,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-1-->L27-2: Formula: (and (= v_main_~y~0_3 (+ v_main_~y~0_4 1)) (< v_main_~c~0_4 v_main_~k~0_6) (= v_main_~x~0_3 (+ v_main_~x~0_4 (* v_main_~y~0_3 v_main_~y~0_3))) (= v_main_~c~0_3 (+ v_main_~c~0_4 1))) InVars {main_~y~0=v_main_~y~0_4, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~x~0=v_main_~x~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {369#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= main_~y~0 1))} is VALID [2022-04-07 20:47:44,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= main_~y~0 1))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= main_~y~0 1))} is VALID [2022-04-07 20:47:44,294 INFO L272 TraceCheckUtils]: 20: Hoare triple {369#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= main_~y~0 1))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (* v_main_~y~0_7 (* v_main_~y~0_7 (* v_main_~y~0_7 2))) (- 1)) (* (- 1) (* v_main_~y~0_7 (* v_main_~y~0_7 3))) (* v_main_~x~0_7 6) (* (- 1) v_main_~y~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:47:44,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {376#(<= 1 |__VERIFIER_assert_#in~cond|)} [78] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:47:44,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {380#(<= 1 __VERIFIER_assert_~cond)} [82] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-07 20:47:44,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {310#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-07 20:47:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 20:47:44,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:47:44,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {310#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-07 20:47:44,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {380#(<= 1 __VERIFIER_assert_~cond)} [82] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-07 20:47:44,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {376#(<= 1 |__VERIFIER_assert_#in~cond|)} [78] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:47:44,431 INFO L272 TraceCheckUtils]: 20: Hoare triple {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (* v_main_~y~0_7 (* v_main_~y~0_7 (* v_main_~y~0_7 2))) (- 1)) (* (- 1) (* v_main_~y~0_7 (* v_main_~y~0_7 3))) (* v_main_~x~0_7 6) (* (- 1) v_main_~y~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:47:44,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:47:44,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [80] L28-1-->L27-2: Formula: (and (= v_main_~y~0_3 (+ v_main_~y~0_4 1)) (< v_main_~c~0_4 v_main_~k~0_6) (= v_main_~x~0_3 (+ v_main_~x~0_4 (* v_main_~y~0_3 v_main_~y~0_3))) (= v_main_~c~0_3 (+ v_main_~c~0_4 1))) InVars {main_~y~0=v_main_~y~0_4, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~x~0=v_main_~x~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:47:44,436 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {309#true} {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [90] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (* v_main_~y~0_7 (* v_main_~y~0_7 (* v_main_~y~0_7 2))) (- 1)) (* (- 1) (* v_main_~y~0_7 (* v_main_~y~0_7 3))) (* v_main_~x~0_7 6) (* (- 1) v_main_~y~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:47:44,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {309#true} [86] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {309#true} [83] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {309#true} [78] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {309#true} is VALID [2022-04-07 20:47:44,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (* v_main_~y~0_7 (* v_main_~y~0_7 (* v_main_~y~0_7 2))) (- 1)) (* (- 1) (* v_main_~y~0_7 (* v_main_~y~0_7 3))) (* v_main_~x~0_7 6) (* (- 1) v_main_~y~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {309#true} is VALID [2022-04-07 20:47:44,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:47:44,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#true} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {396#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-07 20:47:44,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {309#true} {309#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} [73] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {309#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 50)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} [64] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {309#true} is VALID [2022-04-07 20:47:44,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-07 20:47:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 20:47:44,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:47:44,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697374660] [2022-04-07 20:47:44,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:47:44,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220229255] [2022-04-07 20:47:44,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220229255] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 20:47:44,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 20:47:44,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 20:47:44,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112751743] [2022-04-07 20:47:44,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:47:44,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-07 20:47:44,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:47:44,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:47:44,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:47:44,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:47:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:47:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:47:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 20:47:44,918 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:47:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:44,972 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-07 20:47:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 20:47:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-07 20:47:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:47:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:47:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-07 20:47:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:47:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-07 20:47:44,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-07 20:47:45,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:47:45,011 INFO L225 Difference]: With dead ends: 27 [2022-04-07 20:47:45,011 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 20:47:45,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 20:47:45,012 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:47:45,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:47:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 20:47:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 20:47:45,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:47:45,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 20:47:45,013 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 20:47:45,013 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 20:47:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:45,013 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 20:47:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:47:45,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:47:45,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:47:45,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 20:47:45,014 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 20:47:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:47:45,014 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 20:47:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:47:45,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:47:45,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:47:45,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:47:45,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:47:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 20:47:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 20:47:45,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-07 20:47:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:47:45,014 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 20:47:45,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:47:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:47:45,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:47:45,016 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 20:47:45,032 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-07 20:47:45,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 20:47:45,234 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 20:47:45,235 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 20:47:45,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:47:45 BasicIcfg [2022-04-07 20:47:45,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 20:47:45,238 INFO L158 Benchmark]: Toolchain (without parser) took 2720.20ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 138.8MB in the beginning and 152.2MB in the end (delta: -13.4MB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. [2022-04-07 20:47:45,238 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 20:47:45,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.39ms. Allocated memory is still 190.8MB. Free memory was 138.6MB in the beginning and 166.5MB in the end (delta: -27.9MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-04-07 20:47:45,238 INFO L158 Benchmark]: Boogie Preprocessor took 21.00ms. Allocated memory is still 190.8MB. Free memory was 166.5MB in the beginning and 165.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 20:47:45,239 INFO L158 Benchmark]: RCFGBuilder took 226.46ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 154.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 20:47:45,239 INFO L158 Benchmark]: IcfgTransformer took 27.74ms. Allocated memory is still 190.8MB. Free memory was 154.5MB in the beginning and 152.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 20:47:45,239 INFO L158 Benchmark]: TraceAbstraction took 2220.64ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 152.4MB in the beginning and 152.2MB in the end (delta: 245.4kB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. [2022-04-07 20:47:45,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.39ms. Allocated memory is still 190.8MB. Free memory was 138.6MB in the beginning and 166.5MB in the end (delta: -27.9MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.00ms. Allocated memory is still 190.8MB. Free memory was 166.5MB in the beginning and 165.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.46ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 154.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 27.74ms. Allocated memory is still 190.8MB. Free memory was 154.5MB in the beginning and 152.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2220.64ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 152.4MB in the beginning and 152.2MB in the end (delta: 245.4kB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 62 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 2 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 20:47:45,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...