/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:56:46,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:56:46,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:56:46,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:56:46,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:56:46,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:56:46,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:56:46,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:56:46,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:56:46,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:56:46,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:56:46,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:56:46,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:56:46,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:56:46,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:56:46,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:56:46,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:56:46,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:56:46,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:56:46,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:56:46,745 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:56:46,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:56:46,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:56:46,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:56:46,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:56:46,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:56:46,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:56:46,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:56:46,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:56:46,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:56:46,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:56:46,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:56:46,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:56:46,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:56:46,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:56:46,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:56:46,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:56:46,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:56:46,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:56:46,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:56:46,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:56:46,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:56:46,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:56:46,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:56:46,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:56:46,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:56:46,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:56:46,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:56:46,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:56:46,794 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:56:46,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:56:46,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:56:46,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:56:46,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:56:46,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:56:46,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:56:46,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:56:46,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:56:46,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:56:46,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:56:46,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:56:46,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:56:46,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:56:46,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:56:46,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:56:46,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:56:46,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:56:46,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:56:46,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:56:46,797 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:56:46,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:56:46,798 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:56:46,798 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-08 02:56:47,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:56:47,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:56:47,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:56:47,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:56:47,036 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:56:47,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-08 02:56:47,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe829dc07/31cc4cf3c53c406a8cf2947e5c01e884/FLAG2b834ab94 [2022-04-08 02:56:47,465 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:56:47,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-08 02:56:47,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe829dc07/31cc4cf3c53c406a8cf2947e5c01e884/FLAG2b834ab94 [2022-04-08 02:56:47,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe829dc07/31cc4cf3c53c406a8cf2947e5c01e884 [2022-04-08 02:56:47,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:56:47,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:56:47,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:56:47,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:56:47,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:56:47,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f52ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47, skipping insertion in model container [2022-04-08 02:56:47,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:56:47,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:56:47,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-08 02:56:47,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:56:47,745 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:56:47,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-08 02:56:47,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:56:47,795 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:56:47,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47 WrapperNode [2022-04-08 02:56:47,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:56:47,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:56:47,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:56:47,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:56:47,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:56:47,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:56:47,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:56:47,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:56:47,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (1/1) ... [2022-04-08 02:56:47,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:56:47,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:56:47,880 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-08 02:56:47,906 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-08 02:56:47,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:56:47,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:56:47,927 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:56:47,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:56:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:56:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:56:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:56:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:56:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:56:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:56:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:56:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:56:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:56:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:56:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:56:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:56:48,010 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:56:48,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:56:48,224 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:56:48,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:56:48,230 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:56:48,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:48 BoogieIcfgContainer [2022-04-08 02:56:48,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:56:48,232 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:56:48,232 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:56:48,233 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:56:48,245 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:48" (1/1) ... [2022-04-08 02:56:48,247 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:56:48,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:56:48 BasicIcfg [2022-04-08 02:56:48,293 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:56:48,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:56:48,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:56:48,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:56:48,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:56:47" (1/4) ... [2022-04-08 02:56:48,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb22966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:48, skipping insertion in model container [2022-04-08 02:56:48,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:47" (2/4) ... [2022-04-08 02:56:48,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb22966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:48, skipping insertion in model container [2022-04-08 02:56:48,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:48" (3/4) ... [2022-04-08 02:56:48,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb22966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:56:48, skipping insertion in model container [2022-04-08 02:56:48,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:56:48" (4/4) ... [2022-04-08 02:56:48,298 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.cqvasr [2022-04-08 02:56:48,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:56:48,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:56:48,346 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:56:48,353 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 02:56:48,353 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:56:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:56:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 02:56:48,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:48,379 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:48,379 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -498315745, now seen corresponding path program 1 times [2022-04-08 02:56:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:48,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208144070] [2022-04-08 02:56:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:48,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {42#true} is VALID [2022-04-08 02:56:48,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 02:56:48,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 02:56:48,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:48,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {42#true} is VALID [2022-04-08 02:56:48,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 02:56:48,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 02:56:48,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 02:56:48,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {42#true} is VALID [2022-04-08 02:56:48,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {42#true} is VALID [2022-04-08 02:56:48,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {42#true} is VALID [2022-04-08 02:56:48,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [182] L58-->L58-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} [198] L86-1-->L93: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {47#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:48,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} [200] L93-->L128-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-08 02:56:48,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-08 02:56:48,636 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-08 02:56:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:48,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208144070] [2022-04-08 02:56:48,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208144070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:48,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:48,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131674563] [2022-04-08 02:56:48,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:48,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:48,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:48,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:48,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:48,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:48,690 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:49,059 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-08 02:56:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 02:56:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 02:56:49,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 02:56:49,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:49,269 INFO L225 Difference]: With dead ends: 76 [2022-04-08 02:56:49,269 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 02:56:49,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:49,277 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:49,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 02:56:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-08 02:56:49,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:49,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,313 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,314 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:49,320 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-08 02:56:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-08 02:56:49,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:49,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:49,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 02:56:49,324 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 02:56:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:49,332 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-08 02:56:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-08 02:56:49,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:49,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:49,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:49,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-08 02:56:49,351 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-08 02:56:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:49,351 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-08 02:56:49,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-08 02:56:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 02:56:49,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:49,353 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:49,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:56:49,354 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1999700192, now seen corresponding path program 1 times [2022-04-08 02:56:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:49,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351145709] [2022-04-08 02:56:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:49,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {313#true} is VALID [2022-04-08 02:56:49,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-08 02:56:49,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313#true} {313#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-08 02:56:49,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:49,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {313#true} is VALID [2022-04-08 02:56:49,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-08 02:56:49,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-08 02:56:49,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-08 02:56:49,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {313#true} is VALID [2022-04-08 02:56:49,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {313#true} is VALID [2022-04-08 02:56:49,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {313#true} is VALID [2022-04-08 02:56:49,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(= main_~p1~0 0)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {318#(= main_~p1~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#(= main_~p1~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#(= main_~p1~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#(= main_~p1~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#(= main_~p1~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {318#(= main_~p1~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {318#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:49,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {318#(= main_~p1~0 0)} [198] L86-1-->L93: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-08 02:56:49,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {314#false} [200] L93-->L128-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-08 02:56:49,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-08 02:56:49,456 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-08 02:56:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:49,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351145709] [2022-04-08 02:56:49,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351145709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:49,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:49,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621620811] [2022-04-08 02:56:49,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:49,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:49,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:49,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:49,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:49,480 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:49,686 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-08 02:56:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 02:56:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 02:56:49,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-08 02:56:49,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:49,847 INFO L225 Difference]: With dead ends: 98 [2022-04-08 02:56:49,847 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 02:56:49,851 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:49,853 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:49,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 02:56:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-08 02:56:49,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:49,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,867 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,867 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:49,870 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-08 02:56:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-08 02:56:49,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:49,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:49,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 02:56:49,872 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 02:56:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:49,878 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-08 02:56:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-08 02:56:49,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:49,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:49,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:49,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-08 02:56:49,886 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-08 02:56:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:49,887 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-08 02:56:49,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-08 02:56:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:56:49,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:49,888 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:49,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 02:56:49,888 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1732113068, now seen corresponding path program 1 times [2022-04-08 02:56:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:49,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062490163] [2022-04-08 02:56:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:49,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {621#true} is VALID [2022-04-08 02:56:49,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {621#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-08 02:56:49,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {621#true} {621#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-08 02:56:49,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {621#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:49,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {621#true} is VALID [2022-04-08 02:56:49,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {621#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-08 02:56:49,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {621#true} {621#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-08 02:56:49,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {621#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-08 02:56:49,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {621#true} is VALID [2022-04-08 02:56:49,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {621#true} is VALID [2022-04-08 02:56:49,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {621#true} is VALID [2022-04-08 02:56:49,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#true} [182] L58-->L58-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#(not (= main_~p1~0 0))} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(not (= main_~p1~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(not (= main_~p1~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {626#(not (= main_~p1~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {626#(not (= main_~p1~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(not (= main_~p1~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#(not (= main_~p1~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:49,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#(not (= main_~p1~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-08 02:56:49,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#false} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-08 02:56:49,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {622#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-08 02:56:49,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {622#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-08 02:56:49,997 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-08 02:56:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:49,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062490163] [2022-04-08 02:56:49,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062490163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:49,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:49,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212056454] [2022-04-08 02:56:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:56:49,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:49,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:50,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:50,023 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:50,203 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-08 02:56:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:50,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:56:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 02:56:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 02:56:50,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 02:56:50,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:50,334 INFO L225 Difference]: With dead ends: 91 [2022-04-08 02:56:50,334 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 02:56:50,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:50,340 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:50,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 02:56:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-08 02:56:50,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:50,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,355 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,355 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:50,358 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-08 02:56:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-08 02:56:50,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:50,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:50,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 02:56:50,360 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 02:56:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:50,363 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-08 02:56:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-08 02:56:50,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:50,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:50,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:50,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-08 02:56:50,367 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-08 02:56:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:50,367 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-08 02:56:50,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-08 02:56:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:56:50,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:50,368 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:50,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 02:56:50,368 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1861195787, now seen corresponding path program 1 times [2022-04-08 02:56:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:50,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569428536] [2022-04-08 02:56:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:50,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:50,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {933#true} is VALID [2022-04-08 02:56:50,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {933#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-08 02:56:50,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {933#true} {933#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-08 02:56:50,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {933#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:50,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {933#true} is VALID [2022-04-08 02:56:50,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {933#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-08 02:56:50,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {933#true} {933#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-08 02:56:50,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {933#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-08 02:56:50,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {933#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {933#true} is VALID [2022-04-08 02:56:50,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {933#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {933#true} is VALID [2022-04-08 02:56:50,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {933#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {933#true} is VALID [2022-04-08 02:56:50,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {933#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-08 02:56:50,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {933#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {938#(= main_~lk2~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#(= main_~lk2~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(= main_~lk2~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(= main_~lk2~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {938#(= main_~lk2~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {938#(= main_~lk2~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(= main_~lk2~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {938#(= main_~lk2~0 1)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {938#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:50,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {938#(= main_~lk2~0 1)} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {934#false} is VALID [2022-04-08 02:56:50,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {934#false} is VALID [2022-04-08 02:56:50,460 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-08 02:56:50,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:50,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569428536] [2022-04-08 02:56:50,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569428536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:50,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422247197] [2022-04-08 02:56:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:50,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:56:50,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:50,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:50,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:50,481 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:50,629 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2022-04-08 02:56:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:50,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:56:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:50,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 02:56:50,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:50,723 INFO L225 Difference]: With dead ends: 113 [2022-04-08 02:56:50,724 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 02:56:50,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:50,725 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:50,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 02:56:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 81. [2022-04-08 02:56:50,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:50,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,731 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,731 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:50,734 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-08 02:56:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-08 02:56:50,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:50,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:50,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-08 02:56:50,735 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-08 02:56:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:50,738 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-08 02:56:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-08 02:56:50,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:50,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:50,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:50,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 137 transitions. [2022-04-08 02:56:50,742 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 137 transitions. Word has length 20 [2022-04-08 02:56:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:50,742 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 137 transitions. [2022-04-08 02:56:50,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 137 transitions. [2022-04-08 02:56:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:56:50,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:50,743 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:50,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 02:56:50,743 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash 64244428, now seen corresponding path program 1 times [2022-04-08 02:56:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167650861] [2022-04-08 02:56:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:50,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:50,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {1381#true} is VALID [2022-04-08 02:56:50,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-08 02:56:50,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1381#true} {1381#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-08 02:56:50,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {1381#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:50,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {1381#true} is VALID [2022-04-08 02:56:50,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1381#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-08 02:56:50,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-08 02:56:50,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {1381#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-08 02:56:50,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {1381#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1381#true} is VALID [2022-04-08 02:56:50,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {1381#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1381#true} is VALID [2022-04-08 02:56:50,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {1381#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {1381#true} is VALID [2022-04-08 02:56:50,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {1381#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-08 02:56:50,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {1381#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {1386#(= main_~p2~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {1386#(= main_~p2~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {1386#(= main_~p2~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {1386#(= main_~p2~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {1386#(= main_~p2~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#(= main_~p2~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(= main_~p2~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1386#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:50,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(= main_~p2~0 0)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-08 02:56:50,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {1382#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-08 02:56:50,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {1382#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-08 02:56:50,831 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-08 02:56:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:50,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167650861] [2022-04-08 02:56:50,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167650861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:50,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:50,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580837154] [2022-04-08 02:56:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:56:50,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:50,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:50,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:50,858 INFO L87 Difference]: Start difference. First operand 81 states and 137 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:50,998 INFO L93 Difference]: Finished difference Result 185 states and 319 transitions. [2022-04-08 02:56:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:50,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:56:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-08 02:56:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-08 02:56:51,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-08 02:56:51,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:51,126 INFO L225 Difference]: With dead ends: 185 [2022-04-08 02:56:51,126 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 02:56:51,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:51,128 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:51,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 02:56:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-08 02:56:51,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:51,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,146 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,146 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,150 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-08 02:56:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-08 02:56:51,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:51,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:51,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-08 02:56:51,151 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-08 02:56:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,155 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-08 02:56:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-08 02:56:51,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:51,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:51,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:51,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-08 02:56:51,159 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-08 02:56:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:51,159 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-08 02:56:51,160 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-08 02:56:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 02:56:51,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:51,160 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:51,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 02:56:51,160 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1862526652, now seen corresponding path program 1 times [2022-04-08 02:56:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:51,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701214810] [2022-04-08 02:56:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:51,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {1939#true} is VALID [2022-04-08 02:56:51,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-08 02:56:51,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1939#true} {1939#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-08 02:56:51,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:51,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {1939#true} is VALID [2022-04-08 02:56:51,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-08 02:56:51,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-08 02:56:51,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-08 02:56:51,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1939#true} is VALID [2022-04-08 02:56:51,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1939#true} is VALID [2022-04-08 02:56:51,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {1939#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {1939#true} is VALID [2022-04-08 02:56:51,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {1939#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-08 02:56:51,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1939#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#(not (= main_~p2~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {1944#(not (= main_~p2~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(not (= main_~p2~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(not (= main_~p2~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(not (= main_~p2~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#(not (= main_~p2~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(not (= main_~p2~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:51,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(not (= main_~p2~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-08 02:56:51,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1940#false} [208] L97-1-->L103: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-08 02:56:51,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-08 02:56:51,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-08 02:56:51,254 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-08 02:56:51,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:51,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701214810] [2022-04-08 02:56:51,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701214810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:51,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:51,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:51,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036477577] [2022-04-08 02:56:51,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:51,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 02:56:51,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:51,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:51,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:51,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:51,270 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,409 INFO L93 Difference]: Finished difference Result 166 states and 278 transitions. [2022-04-08 02:56:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 02:56:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 02:56:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 02:56:51,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-08 02:56:51,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:51,524 INFO L225 Difference]: With dead ends: 166 [2022-04-08 02:56:51,524 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 02:56:51,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:51,526 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:51,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 02:56:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-04-08 02:56:51,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:51,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,541 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,543 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,546 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-08 02:56:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-08 02:56:51,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:51,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:51,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-08 02:56:51,547 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-08 02:56:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,550 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-08 02:56:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-08 02:56:51,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:51,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:51,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:51,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 187 transitions. [2022-04-08 02:56:51,554 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 187 transitions. Word has length 21 [2022-04-08 02:56:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:51,554 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 187 transitions. [2022-04-08 02:56:51,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 187 transitions. [2022-04-08 02:56:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 02:56:51,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:51,555 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:51,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 02:56:51,555 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1991609371, now seen corresponding path program 1 times [2022-04-08 02:56:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122225737] [2022-04-08 02:56:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:51,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:51,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {2484#true} is VALID [2022-04-08 02:56:51,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2484#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-08 02:56:51,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2484#true} {2484#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-08 02:56:51,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {2484#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:51,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {2484#true} is VALID [2022-04-08 02:56:51,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {2484#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-08 02:56:51,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2484#true} {2484#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-08 02:56:51,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {2484#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-08 02:56:51,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2484#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2484#true} is VALID [2022-04-08 02:56:51,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {2484#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {2484#true} is VALID [2022-04-08 02:56:51,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {2484#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {2484#true} is VALID [2022-04-08 02:56:51,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {2484#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-08 02:56:51,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {2484#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-08 02:56:51,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {2484#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#(= main_~lk3~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {2489#(= main_~lk3~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {2489#(= main_~lk3~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {2489#(= main_~lk3~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {2489#(= main_~lk3~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {2489#(= main_~lk3~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {2489#(= main_~lk3~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {2489#(= main_~lk3~0 1)} [208] L97-1-->L103: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:51,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {2489#(= main_~lk3~0 1)} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2485#false} is VALID [2022-04-08 02:56:51,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {2485#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2485#false} is VALID [2022-04-08 02:56:51,626 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-08 02:56:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:51,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122225737] [2022-04-08 02:56:51,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122225737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:51,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:51,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755233734] [2022-04-08 02:56:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:51,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 02:56:51,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:51,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:51,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:51,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:51,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:51,642 INFO L87 Difference]: Start difference. First operand 113 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,785 INFO L93 Difference]: Finished difference Result 205 states and 345 transitions. [2022-04-08 02:56:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 02:56:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 02:56:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 02:56:51,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-08 02:56:51,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:51,870 INFO L225 Difference]: With dead ends: 205 [2022-04-08 02:56:51,871 INFO L226 Difference]: Without dead ends: 203 [2022-04-08 02:56:51,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:51,872 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:51,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-08 02:56:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 153. [2022-04-08 02:56:51,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:51,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,877 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,878 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,884 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-08 02:56:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-08 02:56:51,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:51,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:51,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-08 02:56:51,886 INFO L87 Difference]: Start difference. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-08 02:56:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:51,892 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-08 02:56:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-08 02:56:51,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:51,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:51,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:51,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 251 transitions. [2022-04-08 02:56:51,898 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 251 transitions. Word has length 21 [2022-04-08 02:56:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:51,898 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 251 transitions. [2022-04-08 02:56:51,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 251 transitions. [2022-04-08 02:56:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 02:56:51,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:51,899 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:51,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 02:56:51,899 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 194658012, now seen corresponding path program 1 times [2022-04-08 02:56:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:51,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776553820] [2022-04-08 02:56:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:51,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:51,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {3286#true} is VALID [2022-04-08 02:56:51,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {3286#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-08 02:56:51,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3286#true} {3286#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-08 02:56:51,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {3286#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:51,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {3286#true} is VALID [2022-04-08 02:56:51,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {3286#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-08 02:56:51,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3286#true} {3286#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-08 02:56:51,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {3286#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-08 02:56:51,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {3286#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3286#true} is VALID [2022-04-08 02:56:51,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {3286#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {3286#true} is VALID [2022-04-08 02:56:51,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {3286#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {3286#true} is VALID [2022-04-08 02:56:51,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {3286#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-08 02:56:51,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {3286#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-08 02:56:51,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {3286#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {3291#(= main_~p3~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {3291#(= main_~p3~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {3291#(= main_~p3~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {3291#(= main_~p3~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {3291#(= main_~p3~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {3291#(= main_~p3~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {3291#(= main_~p3~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3291#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:51,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {3291#(= main_~p3~0 0)} [208] L97-1-->L103: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-08 02:56:51,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {3287#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-08 02:56:51,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {3287#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-08 02:56:51,941 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-08 02:56:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:51,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776553820] [2022-04-08 02:56:51,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776553820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:51,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:51,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813519254] [2022-04-08 02:56:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 02:56:51,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:51,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:51,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:51,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:51,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:51,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:51,958 INFO L87 Difference]: Start difference. First operand 153 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,112 INFO L93 Difference]: Finished difference Result 353 states and 585 transitions. [2022-04-08 02:56:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 02:56:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-08 02:56:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-08 02:56:52,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-08 02:56:52,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:52,263 INFO L225 Difference]: With dead ends: 353 [2022-04-08 02:56:52,264 INFO L226 Difference]: Without dead ends: 211 [2022-04-08 02:56:52,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:52,267 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:52,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-08 02:56:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-04-08 02:56:52,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:52,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,281 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,282 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,287 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-08 02:56:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-08 02:56:52,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:52,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:52,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-08 02:56:52,288 INFO L87 Difference]: Start difference. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-08 02:56:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,294 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-08 02:56:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-08 02:56:52,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:52,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:52,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:52,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 339 transitions. [2022-04-08 02:56:52,306 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 339 transitions. Word has length 21 [2022-04-08 02:56:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:52,307 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 339 transitions. [2022-04-08 02:56:52,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 339 transitions. [2022-04-08 02:56:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:56:52,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:52,308 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:52,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 02:56:52,309 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1610380584, now seen corresponding path program 1 times [2022-04-08 02:56:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:52,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968509250] [2022-04-08 02:56:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:52,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {4316#true} is VALID [2022-04-08 02:56:52,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-08 02:56:52,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4316#true} {4316#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-08 02:56:52,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:52,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {4316#true} is VALID [2022-04-08 02:56:52,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-08 02:56:52,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-08 02:56:52,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-08 02:56:52,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4316#true} is VALID [2022-04-08 02:56:52,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {4316#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {4316#true} is VALID [2022-04-08 02:56:52,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {4316#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {4316#true} is VALID [2022-04-08 02:56:52,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {4316#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-08 02:56:52,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {4316#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-08 02:56:52,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {4316#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {4321#(not (= main_~p3~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {4321#(not (= main_~p3~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {4321#(not (= main_~p3~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {4321#(not (= main_~p3~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {4321#(not (= main_~p3~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {4321#(not (= main_~p3~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {4321#(not (= main_~p3~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:52,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {4321#(not (= main_~p3~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-08 02:56:52,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-08 02:56:52,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-08 02:56:52,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-08 02:56:52,356 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-08 02:56:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:52,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968509250] [2022-04-08 02:56:52,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968509250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:52,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:52,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290212453] [2022-04-08 02:56:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 02:56:52,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:52,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,371 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-08 02:56:52,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:52,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:52,372 INFO L87 Difference]: Start difference. First operand 209 states and 339 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,510 INFO L93 Difference]: Finished difference Result 313 states and 505 transitions. [2022-04-08 02:56:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 02:56:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-08 02:56:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-08 02:56:52,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-08 02:56:52,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:52,616 INFO L225 Difference]: With dead ends: 313 [2022-04-08 02:56:52,616 INFO L226 Difference]: Without dead ends: 215 [2022-04-08 02:56:52,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:52,619 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:52,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-08 02:56:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-08 02:56:52,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:52,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,629 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,629 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,634 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-08 02:56:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-08 02:56:52,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:52,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:52,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-08 02:56:52,636 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-08 02:56:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,641 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-08 02:56:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-08 02:56:52,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:52,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:52,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:52,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2022-04-08 02:56:52,646 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 22 [2022-04-08 02:56:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:52,647 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2022-04-08 02:56:52,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2022-04-08 02:56:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:56:52,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:52,647 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:52,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 02:56:52,648 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1739463303, now seen corresponding path program 1 times [2022-04-08 02:56:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:52,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784280881] [2022-04-08 02:56:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:52,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {5318#true} is VALID [2022-04-08 02:56:52,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {5318#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5318#true} {5318#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {5318#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:52,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {5318#true} is VALID [2022-04-08 02:56:52,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {5318#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5318#true} {5318#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {5318#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {5318#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5318#true} is VALID [2022-04-08 02:56:52,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {5318#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {5318#true} is VALID [2022-04-08 02:56:52,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {5318#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {5318#true} is VALID [2022-04-08 02:56:52,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {5318#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {5318#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {5318#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-08 02:56:52,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {5318#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {5323#(= main_~lk4~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {5323#(= main_~lk4~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {5323#(= main_~lk4~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {5323#(= main_~lk4~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {5323#(= main_~lk4~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {5323#(= main_~lk4~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#(= main_~lk4~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {5323#(= main_~lk4~0 1)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:52,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {5323#(= main_~lk4~0 1)} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {5319#false} is VALID [2022-04-08 02:56:52,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {5319#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5319#false} is VALID [2022-04-08 02:56:52,695 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-08 02:56:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784280881] [2022-04-08 02:56:52,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784280881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:52,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:52,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339104444] [2022-04-08 02:56:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:52,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 02:56:52,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:52,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,710 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-08 02:56:52,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:52,711 INFO L87 Difference]: Start difference. First operand 213 states and 339 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,891 INFO L93 Difference]: Finished difference Result 381 states and 617 transitions. [2022-04-08 02:56:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 02:56:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 02:56:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 02:56:52,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-08 02:56:52,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:53,000 INFO L225 Difference]: With dead ends: 381 [2022-04-08 02:56:53,000 INFO L226 Difference]: Without dead ends: 379 [2022-04-08 02:56:53,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:53,001 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:53,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-08 02:56:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-08 02:56:53,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:53,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,010 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,010 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,021 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-08 02:56:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-08 02:56:53,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:53,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:53,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 02:56:53,023 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 02:56:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,033 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-08 02:56:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-08 02:56:53,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:53,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:53,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:53,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 463 transitions. [2022-04-08 02:56:53,042 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 463 transitions. Word has length 22 [2022-04-08 02:56:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:53,042 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 463 transitions. [2022-04-08 02:56:53,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 463 transitions. [2022-04-08 02:56:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:56:53,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:53,043 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:53,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 02:56:53,044 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:53,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash -57488056, now seen corresponding path program 1 times [2022-04-08 02:56:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:53,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630093897] [2022-04-08 02:56:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:53,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {6804#true} is VALID [2022-04-08 02:56:53,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:53,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {6804#true} is VALID [2022-04-08 02:56:53,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6804#true} is VALID [2022-04-08 02:56:53,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {6804#true} is VALID [2022-04-08 02:56:53,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {6804#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {6804#true} is VALID [2022-04-08 02:56:53,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {6804#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {6804#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {6804#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-08 02:56:53,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {6804#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#(= main_~p4~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#(= main_~p4~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#(= main_~p4~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#(= main_~p4~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#(= main_~p4~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {6809#(= main_~p4~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {6809#(= main_~p4~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:53,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {6809#(= main_~p4~0 0)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-08 02:56:53,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {6805#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-08 02:56:53,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {6805#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-08 02:56:53,082 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-08 02:56:53,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:53,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630093897] [2022-04-08 02:56:53,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630093897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:53,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:53,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983983145] [2022-04-08 02:56:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 02:56:53,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:53,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,097 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-08 02:56:53,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:53,098 INFO L87 Difference]: Start difference. First operand 297 states and 463 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,256 INFO L93 Difference]: Finished difference Result 685 states and 1073 transitions. [2022-04-08 02:56:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:53,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 02:56:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 02:56:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 02:56:53,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-08 02:56:53,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:53,407 INFO L225 Difference]: With dead ends: 685 [2022-04-08 02:56:53,407 INFO L226 Difference]: Without dead ends: 403 [2022-04-08 02:56:53,407 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:53,408 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:53,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-08 02:56:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-08 02:56:53,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:53,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,419 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,420 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,432 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-08 02:56:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-08 02:56:53,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:53,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:53,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-08 02:56:53,434 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-08 02:56:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,446 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-08 02:56:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-08 02:56:53,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:53,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:53,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:53,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 615 transitions. [2022-04-08 02:56:53,461 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 615 transitions. Word has length 22 [2022-04-08 02:56:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:53,461 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 615 transitions. [2022-04-08 02:56:53,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 615 transitions. [2022-04-08 02:56:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 02:56:53,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:53,462 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:53,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 02:56:53,462 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1911180104, now seen corresponding path program 1 times [2022-04-08 02:56:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:53,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376824326] [2022-04-08 02:56:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:53,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {8762#true} is VALID [2022-04-08 02:56:53,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {8762#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8762#true} {8762#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {8762#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:53,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {8762#true} is VALID [2022-04-08 02:56:53,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {8762#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8762#true} {8762#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {8762#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {8762#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8762#true} is VALID [2022-04-08 02:56:53,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {8762#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {8762#true} is VALID [2022-04-08 02:56:53,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {8762#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {8762#true} is VALID [2022-04-08 02:56:53,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {8762#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {8762#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {8762#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-08 02:56:53,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {8762#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {8767#(not (= main_~p4~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {8767#(not (= main_~p4~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {8767#(not (= main_~p4~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {8767#(not (= main_~p4~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {8767#(not (= main_~p4~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {8767#(not (= main_~p4~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {8767#(not (= main_~p4~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:53,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {8767#(not (= main_~p4~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-08 02:56:53,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {8763#false} [216] L107-1-->L113: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-08 02:56:53,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {8763#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-08 02:56:53,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {8763#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-08 02:56:53,507 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-08 02:56:53,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:53,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376824326] [2022-04-08 02:56:53,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376824326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:53,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:53,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626741950] [2022-04-08 02:56:53,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:53,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 02:56:53,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:53,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,524 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-08 02:56:53,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:53,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:53,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:53,525 INFO L87 Difference]: Start difference. First operand 401 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,702 INFO L93 Difference]: Finished difference Result 601 states and 917 transitions. [2022-04-08 02:56:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:53,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 02:56:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-08 02:56:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-08 02:56:53,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-08 02:56:53,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:53,829 INFO L225 Difference]: With dead ends: 601 [2022-04-08 02:56:53,829 INFO L226 Difference]: Without dead ends: 411 [2022-04-08 02:56:53,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:53,831 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:53,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-08 02:56:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-08 02:56:53,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:53,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,842 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,843 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,856 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-08 02:56:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-08 02:56:53,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:53,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:53,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-08 02:56:53,858 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-08 02:56:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:53,870 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-08 02:56:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-08 02:56:53,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:53,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:53,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:53,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 615 transitions. [2022-04-08 02:56:53,885 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 615 transitions. Word has length 23 [2022-04-08 02:56:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:53,885 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 615 transitions. [2022-04-08 02:56:53,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 615 transitions. [2022-04-08 02:56:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 02:56:53,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:53,887 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:53,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 02:56:53,887 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1782097385, now seen corresponding path program 1 times [2022-04-08 02:56:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:53,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552565309] [2022-04-08 02:56:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:53,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {10660#true} is VALID [2022-04-08 02:56:53,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10660#true} {10660#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:53,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {10660#true} is VALID [2022-04-08 02:56:53,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {10660#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {10660#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {10660#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-08 02:56:53,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {10660#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {10665#(= main_~lk5~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {10665#(= main_~lk5~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {10665#(= main_~lk5~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {10665#(= main_~lk5~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {10665#(= main_~lk5~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(= main_~lk5~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {10665#(= main_~lk5~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {10665#(= main_~lk5~0 1)} [216] L107-1-->L113: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:53,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {10665#(= main_~lk5~0 1)} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {10661#false} is VALID [2022-04-08 02:56:53,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10661#false} is VALID [2022-04-08 02:56:53,930 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-08 02:56:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:53,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552565309] [2022-04-08 02:56:53,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552565309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:53,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:53,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218638436] [2022-04-08 02:56:53,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 02:56:53,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:53,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:53,946 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-08 02:56:53,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:53,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:53,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:53,947 INFO L87 Difference]: Start difference. First operand 409 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:54,099 INFO L93 Difference]: Finished difference Result 717 states and 1097 transitions. [2022-04-08 02:56:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 02:56:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 02:56:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 02:56:54,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-08 02:56:54,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:54,199 INFO L225 Difference]: With dead ends: 717 [2022-04-08 02:56:54,199 INFO L226 Difference]: Without dead ends: 715 [2022-04-08 02:56:54,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:54,201 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:54,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-08 02:56:54,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-08 02:56:54,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:54,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,216 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,217 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:54,245 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-08 02:56:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-08 02:56:54,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:54,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:54,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-08 02:56:54,248 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-08 02:56:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:54,276 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-08 02:56:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-08 02:56:54,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:54,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:54,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:54,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 855 transitions. [2022-04-08 02:56:54,301 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 855 transitions. Word has length 23 [2022-04-08 02:56:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:54,301 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 855 transitions. [2022-04-08 02:56:54,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 855 transitions. [2022-04-08 02:56:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 02:56:54,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:54,306 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:54,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 02:56:54,306 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash 715918552, now seen corresponding path program 1 times [2022-04-08 02:56:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:54,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67269994] [2022-04-08 02:56:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:54,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {13466#true} is VALID [2022-04-08 02:56:54,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {13466#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13466#true} {13466#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {13466#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:54,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {13466#true} is VALID [2022-04-08 02:56:54,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {13466#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13466#true} {13466#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {13466#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {13466#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {13466#true} is VALID [2022-04-08 02:56:54,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {13466#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {13466#true} is VALID [2022-04-08 02:56:54,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {13466#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {13466#true} is VALID [2022-04-08 02:56:54,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {13466#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {13466#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {13466#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {13466#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-08 02:56:54,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {13466#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {13471#(= main_~p5~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {13471#(= main_~p5~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {13471#(= main_~p5~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {13471#(= main_~p5~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {13471#(= main_~p5~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {13471#(= main_~p5~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {13471#(= main_~p5~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:54,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {13471#(= main_~p5~0 0)} [216] L107-1-->L113: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-08 02:56:54,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {13467#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-08 02:56:54,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {13467#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-08 02:56:54,342 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-08 02:56:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:54,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67269994] [2022-04-08 02:56:54,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67269994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:54,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:54,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30206239] [2022-04-08 02:56:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:54,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 02:56:54,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:54,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,358 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-08 02:56:54,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:54,359 INFO L87 Difference]: Start difference. First operand 585 states and 855 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:54,606 INFO L93 Difference]: Finished difference Result 1341 states and 1961 transitions. [2022-04-08 02:56:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 02:56:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 02:56:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 02:56:54,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-08 02:56:54,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:54,766 INFO L225 Difference]: With dead ends: 1341 [2022-04-08 02:56:54,766 INFO L226 Difference]: Without dead ends: 779 [2022-04-08 02:56:54,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:54,768 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:54,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-08 02:56:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-08 02:56:54,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:54,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,789 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,790 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:54,826 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-08 02:56:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-08 02:56:54,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:54,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:54,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 779 states. [2022-04-08 02:56:54,830 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 779 states. [2022-04-08 02:56:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:54,866 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-08 02:56:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-08 02:56:54,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:54,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:54,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:54,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1111 transitions. [2022-04-08 02:56:54,907 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1111 transitions. Word has length 23 [2022-04-08 02:56:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:54,908 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1111 transitions. [2022-04-08 02:56:54,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1111 transitions. [2022-04-08 02:56:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 02:56:54,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:54,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:54,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 02:56:54,909 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash 589588388, now seen corresponding path program 1 times [2022-04-08 02:56:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:54,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292796945] [2022-04-08 02:56:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:54,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {17248#true} is VALID [2022-04-08 02:56:54,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {17248#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17248#true} {17248#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {17248#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:54,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {17248#true} is VALID [2022-04-08 02:56:54,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {17248#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17248#true} {17248#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {17248#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {17248#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {17248#true} is VALID [2022-04-08 02:56:54,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {17248#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {17248#true} is VALID [2022-04-08 02:56:54,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {17248#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {17248#true} is VALID [2022-04-08 02:56:54,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {17248#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {17248#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {17248#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {17248#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-08 02:56:54,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {17248#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {17253#(not (= main_~p5~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {17253#(not (= main_~p5~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {17253#(not (= main_~p5~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {17253#(not (= main_~p5~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {17253#(not (= main_~p5~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {17253#(not (= main_~p5~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {17253#(not (= main_~p5~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:54,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {17253#(not (= main_~p5~0 0))} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-08 02:56:54,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {17249#false} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-08 02:56:54,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {17249#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-08 02:56:54,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {17249#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-08 02:56:54,944 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-08 02:56:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:54,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292796945] [2022-04-08 02:56:54,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292796945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:54,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:54,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003646616] [2022-04-08 02:56:54,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:54,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 02:56:54,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:54,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:54,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:54,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:54,962 INFO L87 Difference]: Start difference. First operand 777 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:55,169 INFO L93 Difference]: Finished difference Result 1165 states and 1657 transitions. [2022-04-08 02:56:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:55,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 02:56:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 02:56:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 02:56:55,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-08 02:56:55,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:55,315 INFO L225 Difference]: With dead ends: 1165 [2022-04-08 02:56:55,316 INFO L226 Difference]: Without dead ends: 795 [2022-04-08 02:56:55,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:55,317 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:55,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-08 02:56:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-08 02:56:55,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:55,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,337 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,338 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:55,376 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-08 02:56:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-08 02:56:55,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:55,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:55,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 795 states. [2022-04-08 02:56:55,379 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 795 states. [2022-04-08 02:56:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:55,415 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-08 02:56:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-08 02:56:55,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:55,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:55,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:55,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1111 transitions. [2022-04-08 02:56:55,458 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1111 transitions. Word has length 24 [2022-04-08 02:56:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:55,459 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1111 transitions. [2022-04-08 02:56:55,459 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1111 transitions. [2022-04-08 02:56:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 02:56:55,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:55,460 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:55,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 02:56:55,461 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash 718671107, now seen corresponding path program 1 times [2022-04-08 02:56:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:55,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670668573] [2022-04-08 02:56:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:55,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:55,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:55,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {20902#true} is VALID [2022-04-08 02:56:55,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {20902#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20902#true} {20902#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {20902#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:55,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {20902#true} is VALID [2022-04-08 02:56:55,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {20902#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20902#true} {20902#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {20902#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {20902#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {20902#true} is VALID [2022-04-08 02:56:55,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {20902#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {20902#true} is VALID [2022-04-08 02:56:55,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {20902#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {20902#true} is VALID [2022-04-08 02:56:55,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {20902#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {20902#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {20902#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {20902#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {20902#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-08 02:56:55,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {20902#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {20907#(= main_~lk6~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {20907#(= main_~lk6~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {20907#(= main_~lk6~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {20907#(= main_~lk6~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {20907#(= main_~lk6~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {20907#(= main_~lk6~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {20907#(= main_~lk6~0 1)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {20907#(= main_~lk6~0 1)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:55,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {20907#(= main_~lk6~0 1)} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {20903#false} is VALID [2022-04-08 02:56:55,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {20903#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20903#false} is VALID [2022-04-08 02:56:55,514 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-08 02:56:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:55,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670668573] [2022-04-08 02:56:55,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670668573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:55,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:55,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:55,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145900149] [2022-04-08 02:56:55,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 02:56:55,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:55,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:55,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:55,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:55,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:55,531 INFO L87 Difference]: Start difference. First operand 793 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:55,738 INFO L93 Difference]: Finished difference Result 1357 states and 1929 transitions. [2022-04-08 02:56:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 02:56:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 02:56:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 02:56:55,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-08 02:56:55,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:55,904 INFO L225 Difference]: With dead ends: 1357 [2022-04-08 02:56:55,904 INFO L226 Difference]: Without dead ends: 1355 [2022-04-08 02:56:55,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:55,905 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:55,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-08 02:56:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-08 02:56:55,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:55,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,931 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:56,018 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-08 02:56:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-08 02:56:56,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:56,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:56,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-08 02:56:56,024 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-08 02:56:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:56,109 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-08 02:56:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-08 02:56:56,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:56,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:56,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:56,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1575 transitions. [2022-04-08 02:56:56,183 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1575 transitions. Word has length 24 [2022-04-08 02:56:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:56,183 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1575 transitions. [2022-04-08 02:56:56,184 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1575 transitions. [2022-04-08 02:56:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 02:56:56,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:56,185 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:56,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 02:56:56,186 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:56,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1078280252, now seen corresponding path program 1 times [2022-04-08 02:56:56,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:56,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107164527] [2022-04-08 02:56:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:56,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {26252#true} is VALID [2022-04-08 02:56:56,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {26252#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26252#true} {26252#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {26252#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:56,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {26252#true} is VALID [2022-04-08 02:56:56,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {26252#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26252#true} {26252#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {26252#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {26252#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {26252#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {26252#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {26252#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {26252#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {26252#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {26252#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {26252#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-08 02:56:56,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {26252#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {26257#(= main_~p6~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {26257#(= main_~p6~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {26257#(= main_~p6~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {26257#(= main_~p6~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {26257#(= main_~p6~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {26257#(= main_~p6~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {26257#(= main_~p6~0 0)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:56,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {26257#(= main_~p6~0 0)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-08 02:56:56,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {26253#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-08 02:56:56,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {26253#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-08 02:56:56,225 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-08 02:56:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107164527] [2022-04-08 02:56:56,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107164527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:56,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:56,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330706297] [2022-04-08 02:56:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:56,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 02:56:56,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:56,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:56,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:56,242 INFO L87 Difference]: Start difference. First operand 1161 states and 1575 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:56,654 INFO L93 Difference]: Finished difference Result 2637 states and 3561 transitions. [2022-04-08 02:56:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:56,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 02:56:56,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 02:56:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 02:56:56,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-08 02:56:56,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:56,824 INFO L225 Difference]: With dead ends: 2637 [2022-04-08 02:56:56,824 INFO L226 Difference]: Without dead ends: 1515 [2022-04-08 02:56:56,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:56,826 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:56,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-08 02:56:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-08 02:56:56,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:56,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,873 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,874 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:56,977 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-08 02:56:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-08 02:56:56,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:56,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:56,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1515 states. [2022-04-08 02:56:56,984 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1515 states. [2022-04-08 02:56:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:57,088 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-08 02:56:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-08 02:56:57,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:57,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:57,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:57,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1991 transitions. [2022-04-08 02:56:57,209 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1991 transitions. Word has length 24 [2022-04-08 02:56:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:57,210 INFO L478 AbstractCegarLoop]: Abstraction has 1513 states and 1991 transitions. [2022-04-08 02:56:57,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1991 transitions. [2022-04-08 02:56:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 02:56:57,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:57,212 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:57,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 02:56:57,212 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:57,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 804000436, now seen corresponding path program 1 times [2022-04-08 02:56:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:57,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946723439] [2022-04-08 02:56:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:57,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:57,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {33618#true} is VALID [2022-04-08 02:56:57,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {33618#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33618#true} {33618#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {33618#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:57,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {33618#true} is VALID [2022-04-08 02:56:57,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {33618#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33618#true} {33618#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {33618#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {33618#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {33618#true} is VALID [2022-04-08 02:56:57,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {33618#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {33618#true} is VALID [2022-04-08 02:56:57,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {33618#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {33618#true} is VALID [2022-04-08 02:56:57,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {33618#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {33618#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {33618#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {33618#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {33618#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-08 02:56:57,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {33618#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {33623#(not (= main_~p6~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {33623#(not (= main_~p6~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {33623#(not (= main_~p6~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {33623#(not (= main_~p6~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {33623#(not (= main_~p6~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {33623#(not (= main_~p6~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {33623#(not (= main_~p6~0 0))} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:57,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {33623#(not (= main_~p6~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-08 02:56:57,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {33619#false} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-08 02:56:57,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {33619#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-08 02:56:57,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {33619#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-08 02:56:57,249 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-08 02:56:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946723439] [2022-04-08 02:56:57,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946723439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:57,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:57,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225298377] [2022-04-08 02:56:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 02:56:57,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:57,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:57,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:57,267 INFO L87 Difference]: Start difference. First operand 1513 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:57,672 INFO L93 Difference]: Finished difference Result 2269 states and 2969 transitions. [2022-04-08 02:56:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:57,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 02:56:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 02:56:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 02:56:57,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-08 02:56:57,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:57,899 INFO L225 Difference]: With dead ends: 2269 [2022-04-08 02:56:57,899 INFO L226 Difference]: Without dead ends: 1547 [2022-04-08 02:56:57,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:57,901 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:57,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-08 02:56:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-08 02:56:57,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:57,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,940 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:57,942 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:58,058 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-08 02:56:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-08 02:56:58,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:58,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:58,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-08 02:56:58,065 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-08 02:56:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:58,173 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-08 02:56:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-08 02:56:58,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:58,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:58,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:58,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1991 transitions. [2022-04-08 02:56:58,310 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1991 transitions. Word has length 25 [2022-04-08 02:56:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:58,311 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 1991 transitions. [2022-04-08 02:56:58,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1991 transitions. [2022-04-08 02:56:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 02:56:58,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:58,313 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:58,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 02:56:58,313 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash 933083155, now seen corresponding path program 1 times [2022-04-08 02:56:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:58,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100807024] [2022-04-08 02:56:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:58,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:58,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {40712#true} is VALID [2022-04-08 02:56:58,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {40712#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40712#true} {40712#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {40712#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:58,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {40712#true} is VALID [2022-04-08 02:56:58,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {40712#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40712#true} {40712#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {40712#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {40712#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {40712#true} is VALID [2022-04-08 02:56:58,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {40712#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {40712#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {40712#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {40712#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {40712#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {40712#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {40712#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {40712#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-08 02:56:58,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {40712#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {40717#(= main_~lk7~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {40717#(= main_~lk7~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {40717#(= main_~lk7~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {40717#(= main_~lk7~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {40717#(= main_~lk7~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {40717#(= main_~lk7~0 1)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {40717#(= main_~lk7~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {40717#(= main_~lk7~0 1)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:58,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {40717#(= main_~lk7~0 1)} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {40713#false} is VALID [2022-04-08 02:56:58,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {40713#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40713#false} is VALID [2022-04-08 02:56:58,350 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-08 02:56:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:58,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100807024] [2022-04-08 02:56:58,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100807024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:58,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:58,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:58,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118827929] [2022-04-08 02:56:58,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:58,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 02:56:58,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:58,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:58,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:58,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:58,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:58,370 INFO L87 Difference]: Start difference. First operand 1545 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:58,792 INFO L93 Difference]: Finished difference Result 2573 states and 3337 transitions. [2022-04-08 02:56:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:58,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 02:56:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 02:56:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 02:56:58,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-08 02:56:58,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:59,043 INFO L225 Difference]: With dead ends: 2573 [2022-04-08 02:56:59,044 INFO L226 Difference]: Without dead ends: 2571 [2022-04-08 02:56:59,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:59,045 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:59,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-08 02:56:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-08 02:56:59,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:59,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:59,103 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:59,105 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:59,348 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-08 02:56:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-08 02:56:59,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:59,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:59,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2571 states. [2022-04-08 02:56:59,358 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2571 states. [2022-04-08 02:56:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:59,632 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-08 02:56:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-08 02:56:59,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:59,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:59,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:59,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2887 transitions. [2022-04-08 02:56:59,893 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2887 transitions. Word has length 25 [2022-04-08 02:56:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:59,893 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 2887 transitions. [2022-04-08 02:56:59,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2887 transitions. [2022-04-08 02:56:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 02:56:59,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:59,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:59,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 02:56:59,896 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:59,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -863868204, now seen corresponding path program 1 times [2022-04-08 02:56:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:59,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800409362] [2022-04-08 02:56:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:59,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:59,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {50958#true} is VALID [2022-04-08 02:56:59,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {50958#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50958#true} {50958#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {50958#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:59,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {50958#true} is VALID [2022-04-08 02:56:59,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {50958#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50958#true} {50958#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {50958#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {50958#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {50958#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {50958#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {50958#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {50958#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {50958#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {50958#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {50958#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {50958#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-08 02:56:59,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {50958#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {50963#(= main_~p7~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {50963#(= main_~p7~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {50963#(= main_~p7~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {50963#(= main_~p7~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {50963#(= main_~p7~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {50963#(= main_~p7~0 0)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {50963#(= main_~p7~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:59,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {50963#(= main_~p7~0 0)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-08 02:56:59,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {50959#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-08 02:56:59,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {50959#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-08 02:56:59,936 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-08 02:56:59,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:59,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800409362] [2022-04-08 02:56:59,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800409362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:59,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:59,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:59,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259855085] [2022-04-08 02:56:59,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:59,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 02:56:59,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:59,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:59,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:59,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:59,952 INFO L87 Difference]: Start difference. First operand 2313 states and 2887 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:01,212 INFO L93 Difference]: Finished difference Result 5197 states and 6409 transitions. [2022-04-08 02:57:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:57:01,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 02:57:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:57:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 02:57:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 02:57:01,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-08 02:57:01,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:01,551 INFO L225 Difference]: With dead ends: 5197 [2022-04-08 02:57:01,551 INFO L226 Difference]: Without dead ends: 2955 [2022-04-08 02:57:01,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:57:01,555 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:57:01,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:57:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-08 02:57:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-08 02:57:01,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:57:01,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:01,623 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:01,626 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:01,872 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-08 02:57:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-08 02:57:01,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:01,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:01,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-08 02:57:01,885 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-08 02:57:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:02,233 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-08 02:57:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-08 02:57:02,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:02,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:02,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:02,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3527 transitions. [2022-04-08 02:57:02,602 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3527 transitions. Word has length 25 [2022-04-08 02:57:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:02,602 INFO L478 AbstractCegarLoop]: Abstraction has 2953 states and 3527 transitions. [2022-04-08 02:57:02,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3527 transitions. [2022-04-08 02:57:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:57:02,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:57:02,605 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:57:02,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 02:57:02,606 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:57:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:57:02,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1139160544, now seen corresponding path program 1 times [2022-04-08 02:57:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:57:02,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362786798] [2022-04-08 02:57:02,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:57:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:57:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:02,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:57:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:02,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {65364#true} is VALID [2022-04-08 02:57:02,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {65364#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65364#true} {65364#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {65364#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:57:02,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {65364#true} is VALID [2022-04-08 02:57:02,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {65364#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65364#true} {65364#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {65364#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {65364#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {65364#true} is VALID [2022-04-08 02:57:02,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {65364#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {65364#true} is VALID [2022-04-08 02:57:02,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {65364#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {65364#true} is VALID [2022-04-08 02:57:02,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {65364#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {65364#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {65364#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {65364#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {65364#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {65364#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-08 02:57:02,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {65364#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {65369#(not (= main_~p7~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {65369#(not (= main_~p7~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {65369#(not (= main_~p7~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {65369#(not (= main_~p7~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {65369#(not (= main_~p7~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {65369#(not (= main_~p7~0 0))} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {65369#(not (= main_~p7~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:57:02,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {65369#(not (= main_~p7~0 0))} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-08 02:57:02,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {65365#false} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-08 02:57:02,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {65365#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-08 02:57:02,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {65365#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-08 02:57:02,647 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-08 02:57:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:57:02,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362786798] [2022-04-08 02:57:02,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362786798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:57:02,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:57:02,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:57:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996206796] [2022-04-08 02:57:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:57:02,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:57:02,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:57:02,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:02,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:02,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:57:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:57:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:57:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:57:02,666 INFO L87 Difference]: Start difference. First operand 2953 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:03,463 INFO L93 Difference]: Finished difference Result 4429 states and 5257 transitions. [2022-04-08 02:57:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:57:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:57:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:57:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 02:57:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 02:57:03,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 02:57:03,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:03,803 INFO L225 Difference]: With dead ends: 4429 [2022-04-08 02:57:03,803 INFO L226 Difference]: Without dead ends: 3019 [2022-04-08 02:57:03,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:57:03,805 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:57:03,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:57:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-08 02:57:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-08 02:57:03,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:57:03,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,869 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,872 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:04,141 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-08 02:57:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-08 02:57:04,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:04,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:04,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3019 states. [2022-04-08 02:57:04,151 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3019 states. [2022-04-08 02:57:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:04,438 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-08 02:57:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-08 02:57:04,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:04,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:04,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:04,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3527 transitions. [2022-04-08 02:57:04,755 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3527 transitions. Word has length 26 [2022-04-08 02:57:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:04,755 INFO L478 AbstractCegarLoop]: Abstraction has 3017 states and 3527 transitions. [2022-04-08 02:57:04,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3527 transitions. [2022-04-08 02:57:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:57:04,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:57:04,758 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:57:04,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 02:57:04,758 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:57:04,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:57:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1010077825, now seen corresponding path program 1 times [2022-04-08 02:57:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:57:04,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318028071] [2022-04-08 02:57:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:57:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:57:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:57:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:04,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {79194#true} is VALID [2022-04-08 02:57:04,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {79194#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79194#true} {79194#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {79194#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:57:04,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {79194#true} is VALID [2022-04-08 02:57:04,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {79194#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79194#true} {79194#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {79194#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {79194#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {79194#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {79194#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {79194#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {79194#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {79194#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {79194#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {79194#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {79194#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {79194#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-08 02:57:04,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {79194#true} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {79199#(= main_~lk8~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {79199#(= main_~lk8~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {79199#(= main_~lk8~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {79199#(= main_~lk8~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {79199#(= main_~lk8~0 1)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {79199#(= main_~lk8~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {79199#(= main_~lk8~0 1)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {79199#(= main_~lk8~0 1)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-08 02:57:04,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {79199#(= main_~lk8~0 1)} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {79195#false} is VALID [2022-04-08 02:57:04,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {79195#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79195#false} is VALID [2022-04-08 02:57:04,805 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-08 02:57:04,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:57:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318028071] [2022-04-08 02:57:04,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318028071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:57:04,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:57:04,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:57:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778573824] [2022-04-08 02:57:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:57:04,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:57:04,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:57:04,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:04,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:04,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:57:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:57:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:57:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:57:04,824 INFO L87 Difference]: Start difference. First operand 3017 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:05,843 INFO L93 Difference]: Finished difference Result 4875 states and 5640 transitions. [2022-04-08 02:57:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:57:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:57:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:57:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 02:57:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 02:57:05,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-08 02:57:05,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:06,600 INFO L225 Difference]: With dead ends: 4875 [2022-04-08 02:57:06,600 INFO L226 Difference]: Without dead ends: 4873 [2022-04-08 02:57:06,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:57:06,601 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:57:06,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:57:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-08 02:57:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-08 02:57:06,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:57:06,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:06,696 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:06,700 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:07,465 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-08 02:57:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-08 02:57:07,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:07,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:07,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4873 states. [2022-04-08 02:57:07,474 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4873 states. [2022-04-08 02:57:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:08,216 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-08 02:57:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-08 02:57:08,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:08,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:08,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:08,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5255 transitions. [2022-04-08 02:57:08,919 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5255 transitions. Word has length 26 [2022-04-08 02:57:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:08,919 INFO L478 AbstractCegarLoop]: Abstraction has 4617 states and 5255 transitions. [2022-04-08 02:57:08,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5255 transitions. [2022-04-08 02:57:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:57:08,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:57:08,924 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:57:08,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 02:57:08,925 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:57:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:57:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1487938112, now seen corresponding path program 1 times [2022-04-08 02:57:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:57:08,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477173002] [2022-04-08 02:57:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:57:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:57:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:57:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:08,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {98841#true} is VALID [2022-04-08 02:57:08,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {98841#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98841#true} {98841#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {98841#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:57:08,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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] {98841#true} is VALID [2022-04-08 02:57:08,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {98841#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98841#true} {98841#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {98841#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {98841#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {98841#true} is VALID [2022-04-08 02:57:08,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {98841#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {98841#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {98841#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {98841#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {98841#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {98841#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {98841#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {98841#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {98841#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-08 02:57:08,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {98841#true} [197] L82-1-->L86-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {98846#(= main_~p8~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {98846#(= main_~p8~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {98846#(= main_~p8~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {98846#(= main_~p8~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {98846#(= main_~p8~0 0)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {98846#(= main_~p8~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {98846#(= main_~p8~0 0)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:08,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {98846#(= main_~p8~0 0)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-08 02:57:08,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {98842#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-08 02:57:08,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {98842#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-08 02:57:08,978 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-08 02:57:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:57:08,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477173002] [2022-04-08 02:57:08,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477173002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:57:08,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:57:08,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:57:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003233220] [2022-04-08 02:57:08,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:57:08,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:57:08,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:57:08,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:08,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:08,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:57:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:57:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:57:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:57:08,996 INFO L87 Difference]: Start difference. First operand 4617 states and 5255 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:12,304 INFO L93 Difference]: Finished difference Result 10249 states and 11399 transitions. [2022-04-08 02:57:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:57:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:57:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:57:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 02:57:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 02:57:12,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 02:57:12,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:12,385 INFO L225 Difference]: With dead ends: 10249 [2022-04-08 02:57:12,385 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 02:57:12,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:57:12,393 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:57:12,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:57:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 02:57:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 02:57:12,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:57:12,394 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-08 02:57:12,394 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-08 02:57:12,395 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-08 02:57:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:12,395 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:57:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:57:12,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:12,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:12,395 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-08 02:57:12,395 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-08 02:57:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:12,395 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:57:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:57:12,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:12,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:12,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:12,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:12,396 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-08 02:57:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 02:57:12,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-08 02:57:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:12,396 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 02:57:12,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:57:12,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:12,399 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:57:12,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 02:57:12,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 02:57:23,747 WARN L232 SmtUtils]: Spent 11.33s on a formula simplification that was a NOOP. DAG size: 1070 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 02:57:23,776 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 02:57:23,776 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:57:23,776 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:57:23,776 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 02:57:23,776 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 02:57:23,776 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:57:23,776 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:57:23,776 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-08 02:57:23,776 INFO L885 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-08 02:57:23,777 INFO L885 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 6 137) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 6 137) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,777 INFO L882 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L878 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,778 INFO L882 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-08 02:57:23,779 INFO L882 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,779 INFO L882 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-04-08 02:57:23,779 INFO L882 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,779 INFO L882 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-04-08 02:57:23,779 INFO L882 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-04-08 02:57:23,779 INFO L882 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-04-08 02:57:23,781 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:57:23,783 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:57:23,786 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:57:23,786 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:57:23,786 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 02:57:23,786 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:57:23,786 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-08 02:57:23,787 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-08 02:57:23,788 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-08 02:57:23,789 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-08 02:57:23,790 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-08 02:57:23,790 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-08 02:57:23,790 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-08 02:57:23,790 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-08 02:57:23,790 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 02:57:23,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:57:23 BasicIcfg [2022-04-08 02:57:23,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:57:23,796 INFO L158 Benchmark]: Toolchain (without parser) took 36301.54ms. Allocated memory was 189.8MB in the beginning and 429.9MB in the end (delta: 240.1MB). Free memory was 130.6MB in the beginning and 276.8MB in the end (delta: -146.2MB). Peak memory consumption was 240.3MB. Max. memory is 8.0GB. [2022-04-08 02:57:23,796 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:57:23,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.21ms. Allocated memory is still 189.8MB. Free memory was 130.3MB in the beginning and 159.2MB in the end (delta: -28.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 02:57:23,796 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 189.8MB. Free memory was 159.2MB in the beginning and 157.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:57:23,797 INFO L158 Benchmark]: RCFGBuilder took 384.08ms. Allocated memory is still 189.8MB. Free memory was 157.1MB in the beginning and 144.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 02:57:23,797 INFO L158 Benchmark]: IcfgTransformer took 60.49ms. Allocated memory is still 189.8MB. Free memory was 144.1MB in the beginning and 142.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 02:57:23,797 INFO L158 Benchmark]: TraceAbstraction took 35501.12ms. Allocated memory was 189.8MB in the beginning and 429.9MB in the end (delta: 240.1MB). Free memory was 141.4MB in the beginning and 276.8MB in the end (delta: -135.4MB). Peak memory consumption was 250.9MB. Max. memory is 8.0GB. [2022-04-08 02:57:23,798 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.21ms. Allocated memory is still 189.8MB. Free memory was 130.3MB in the beginning and 159.2MB in the end (delta: -28.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 189.8MB. Free memory was 159.2MB in the beginning and 157.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 384.08ms. Allocated memory is still 189.8MB. Free memory was 157.1MB in the beginning and 144.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 60.49ms. Allocated memory is still 189.8MB. Free memory was 144.1MB in the beginning and 142.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 35501.12ms. Allocated memory was 189.8MB in the beginning and 429.9MB in the end (delta: 240.1MB). Free memory was 141.4MB in the beginning and 276.8MB in the end (delta: -135.4MB). Peak memory consumption was 250.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: 135]: 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 3 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2368 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2368 mSDsluCounter, 1785 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1622 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=22, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 11.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 02:57:23,829 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...