/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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:00:41,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:00:41,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:00:41,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:00:41,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:00:41,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:00:41,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:00:41,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:00:41,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:00:41,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:00:41,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:00:41,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:00:41,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:00:41,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:00:41,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:00:41,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:00:41,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:00:41,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:00:41,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:00:41,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:00:41,880 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:00:41,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:00:41,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:00:41,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:00:41,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:00:41,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:00:41,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:00:41,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:00:41,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:00:41,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:00:41,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:00:41,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:00:41,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:00:41,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:00:41,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:00:41,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:00:41,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:00:41,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:00:41,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:00:41,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:00:41,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:00:41,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:00:41,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 05:00:41,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:00:41,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:00:41,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 05:00:41,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 05:00:41,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 05:00:41,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 05:00:41,915 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 05:00:41,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:00:41,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:00:41,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:00:41,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:00:41,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:00:41,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:00:41,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:00:41,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:00:41,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:00:41,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 05:00:41,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:00:41,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 05:00:41,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 05:00:41,918 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 05:00:41,918 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-15 05:00:42,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:00:42,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:00:42,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:00:42,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:00:42,107 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:00:42,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-04-15 05:00:42,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bac9313e/c3a65d85b0214250b6553f2cb75e7305/FLAG1e91c7633 [2022-04-15 05:00:42,530 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:00:42,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-15 05:00:42,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bac9313e/c3a65d85b0214250b6553f2cb75e7305/FLAG1e91c7633 [2022-04-15 05:00:42,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bac9313e/c3a65d85b0214250b6553f2cb75e7305 [2022-04-15 05:00:42,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:00:42,554 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 05:00:42,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:00:42,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:00:42,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:00:42,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6859a16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42, skipping insertion in model container [2022-04-15 05:00:42,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:00:42,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:00:42,779 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_12.c[4591,4604] [2022-04-15 05:00:42,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:00:42,786 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:00:42,821 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_12.c[4591,4604] [2022-04-15 05:00:42,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:00:42,829 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:00:42,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42 WrapperNode [2022-04-15 05:00:42,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:00:42,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:00:42,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:00:42,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:00:42,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:00:42,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:00:42,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:00:42,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:00:42,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (1/1) ... [2022-04-15 05:00:42,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:00:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:00:42,914 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-15 05:00:42,932 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-15 05:00:42,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:00:42,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:00:42,942 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:00:42,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:00:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:00:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:00:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:00:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:00:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:00:43,007 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:00:43,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:00:43,244 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:00:43,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:00:43,249 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:00:43,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:00:43 BoogieIcfgContainer [2022-04-15 05:00:43,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:00:43,251 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 05:00:43,251 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 05:00:43,253 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 05:00:43,256 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:00:43" (1/1) ... [2022-04-15 05:00:43,257 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 05:00:43,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:00:43 BasicIcfg [2022-04-15 05:00:43,303 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 05:00:43,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:00:43,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:00:43,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:00:43,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:00:42" (1/4) ... [2022-04-15 05:00:43,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247612d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:00:43, skipping insertion in model container [2022-04-15 05:00:43,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:42" (2/4) ... [2022-04-15 05:00:43,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247612d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:00:43, skipping insertion in model container [2022-04-15 05:00:43,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:00:43" (3/4) ... [2022-04-15 05:00:43,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247612d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:00:43, skipping insertion in model container [2022-04-15 05:00:43,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:00:43" (4/4) ... [2022-04-15 05:00:43,316 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.cqvasr [2022-04-15 05:00:43,319 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:00:43,319 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:00:43,353 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:00:43,358 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-15 05:00:43,358 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:00:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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-15 05:00:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:00:43,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:43,391 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-15 05:00:43,392 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1823990193, now seen corresponding path program 1 times [2022-04-15 05:00:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:43,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713134560] [2022-04-15 05:00:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:43,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {54#true} is VALID [2022-04-15 05:00:43,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-15 05:00:43,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-15 05:00:43,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:43,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {54#true} is VALID [2022-04-15 05:00:43,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-15 05:00:43,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-15 05:00:43,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-15 05:00:43,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {54#true} is VALID [2022-04-15 05:00:43,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {54#true} is VALID [2022-04-15 05:00:43,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {54#true} is VALID [2022-04-15 05:00:43,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} [250] L78-->L78-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} [252] L78-2-->L82-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} [254] L82-1-->L86-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} [262] L98-1-->L102-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} [264] L102-1-->L106-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} [274] L122-1-->L129: 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[] {59#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:43,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} [276] L129-->L184-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[] {55#false} is VALID [2022-04-15 05:00:43,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55#false} is VALID [2022-04-15 05:00:43,684 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-15 05:00:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:43,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713134560] [2022-04-15 05:00:43,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713134560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:43,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:43,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657728013] [2022-04-15 05:00:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:43,692 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-15 05:00:43,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:43,695 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-15 05:00:43,722 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-15 05:00:43,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:43,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:43,743 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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 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-15 05:00:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:44,079 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2022-04-15 05:00:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:44,079 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-15 05:00:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:44,081 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-15 05:00:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 05:00:44,092 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-15 05:00:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 05:00:44,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-15 05:00:44,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:44,248 INFO L225 Difference]: With dead ends: 100 [2022-04-15 05:00:44,249 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 05:00:44,251 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-15 05:00:44,253 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:44,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 05:00:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-15 05:00:44,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:44,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-15 05:00:44,276 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-15 05:00:44,277 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-15 05:00:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:44,281 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-15 05:00:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-15 05:00:44,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:44,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:44,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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 85 states. [2022-04-15 05:00:44,283 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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 85 states. [2022-04-15 05:00:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:44,287 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-15 05:00:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-15 05:00:44,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:44,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:44,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:44,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-15 05:00:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-15 05:00:44,292 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-15 05:00:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:44,292 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-15 05:00:44,292 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-15 05:00:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-15 05:00:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:00:44,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:44,293 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-15 05:00:44,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:00:44,293 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash -316438384, now seen corresponding path program 1 times [2022-04-15 05:00:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:44,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799469665] [2022-04-15 05:00:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:44,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:44,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {413#true} is VALID [2022-04-15 05:00:44,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-15 05:00:44,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-15 05:00:44,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:44,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {413#true} is VALID [2022-04-15 05:00:44,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-15 05:00:44,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-15 05:00:44,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-15 05:00:44,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {413#true} is VALID [2022-04-15 05:00:44,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {413#true} is VALID [2022-04-15 05:00:44,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {413#true} is VALID [2022-04-15 05:00:44,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#true} [251] L78-->L78-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[] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#(= main_~p1~0 0)} [252] L78-2-->L82-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] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#(= main_~p1~0 0)} [254] L82-1-->L86-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] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#(= main_~p1~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#(= main_~p1~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#(= main_~p1~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#(= main_~p1~0 0)} [262] L98-1-->L102-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] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#(= main_~p1~0 0)} [264] L102-1-->L106-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] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#(= main_~p1~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#(= main_~p1~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#(= main_~p1~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {418#(= main_~p1~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {418#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:44,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {418#(= main_~p1~0 0)} [274] L122-1-->L129: 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[] {414#false} is VALID [2022-04-15 05:00:44,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {414#false} [276] L129-->L184-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[] {414#false} is VALID [2022-04-15 05:00:44,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {414#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-15 05:00:44,352 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-15 05:00:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:44,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799469665] [2022-04-15 05:00:44,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799469665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:44,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:44,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:44,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528839107] [2022-04-15 05:00:44,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:44,353 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-15 05:00:44,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:44,354 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-15 05:00:44,369 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-15 05:00:44,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:44,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:44,370 INFO L87 Difference]: Start difference. First operand 59 states and 106 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-15 05:00:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:44,548 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions. [2022-04-15 05:00:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:44,548 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-15 05:00:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:44,548 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-15 05:00:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 05:00:44,551 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-15 05:00:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 05:00:44,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-15 05:00:44,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:44,726 INFO L225 Difference]: With dead ends: 138 [2022-04-15 05:00:44,726 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 05:00:44,729 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-15 05:00:44,731 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:44,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 05:00:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-15 05:00:44,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:44,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-15 05:00:44,739 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-15 05:00:44,740 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-15 05:00:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:44,742 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-15 05:00:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-15 05:00:44,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:44,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:44,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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 85 states. [2022-04-15 05:00:44,743 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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 85 states. [2022-04-15 05:00:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:44,746 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-15 05:00:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-15 05:00:44,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:44,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:44,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:44,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-15 05:00:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-15 05:00:44,749 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-15 05:00:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:44,749 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-15 05:00:44,749 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-15 05:00:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-15 05:00:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:00:44,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:44,750 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-15 05:00:44,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:00:44,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash -709089080, now seen corresponding path program 1 times [2022-04-15 05:00:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:44,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983468426] [2022-04-15 05:00:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:44,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:44,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {833#true} is VALID [2022-04-15 05:00:44,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-15 05:00:44,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {833#true} {833#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-15 05:00:44,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:44,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {833#true} is VALID [2022-04-15 05:00:44,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-15 05:00:44,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-15 05:00:44,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-15 05:00:44,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {833#true} is VALID [2022-04-15 05:00:44,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {833#true} is VALID [2022-04-15 05:00:44,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {833#true} is VALID [2022-04-15 05:00:44,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} [250] L78-->L78-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= main_~p1~0 0))} [252] L78-2-->L82-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#(not (= main_~p1~0 0))} [254] L82-1-->L86-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#(not (= main_~p1~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#(not (= main_~p1~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#(not (= main_~p1~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(not (= main_~p1~0 0))} [262] L98-1-->L102-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#(not (= main_~p1~0 0))} [264] L102-1-->L106-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {838#(not (= main_~p1~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {838#(not (= main_~p1~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {838#(not (= main_~p1~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#(not (= main_~p1~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:44,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#(not (= main_~p1~0 0))} [275] L122-1-->L128-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[] {834#false} is VALID [2022-04-15 05:00:44,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {834#false} [278] L128-1-->L134: 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[] {834#false} is VALID [2022-04-15 05:00:44,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {834#false} [282] L134-->L184-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[] {834#false} is VALID [2022-04-15 05:00:44,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {834#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#false} is VALID [2022-04-15 05:00:44,802 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-15 05:00:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:44,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983468426] [2022-04-15 05:00:44,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983468426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:44,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:44,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157073340] [2022-04-15 05:00:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:44,803 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-15 05:00:44,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:44,803 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-15 05:00:44,817 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-15 05:00:44,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:44,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:44,818 INFO L87 Difference]: Start difference. First operand 83 states and 150 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-15 05:00:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,006 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2022-04-15 05:00:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:45,006 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-15 05:00:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:45,006 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-15 05:00:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 05:00:45,008 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-15 05:00:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 05:00:45,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-15 05:00:45,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:45,158 INFO L225 Difference]: With dead ends: 127 [2022-04-15 05:00:45,158 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 05:00:45,158 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-15 05:00:45,159 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:45,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 05:00:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-15 05:00:45,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:45,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-15 05:00:45,164 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-15 05:00:45,164 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-15 05:00:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,166 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-15 05:00:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-15 05:00:45,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:45,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:45,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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 88 states. [2022-04-15 05:00:45,167 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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 88 states. [2022-04-15 05:00:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,177 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-15 05:00:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-15 05:00:45,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:45,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:45,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:45,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-15 05:00:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-15 05:00:45,180 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-15 05:00:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:45,180 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-15 05:00:45,180 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-15 05:00:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-15 05:00:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:00:45,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:45,182 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-15 05:00:45,182 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:00:45,182 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:45,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1219623257, now seen corresponding path program 1 times [2022-04-15 05:00:45,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:45,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103260571] [2022-04-15 05:00:45,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:45,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {1259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {1253#true} is VALID [2022-04-15 05:00:45,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1253#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-15 05:00:45,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1253#true} {1253#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-15 05:00:45,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {1253#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:45,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {1253#true} is VALID [2022-04-15 05:00:45,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {1253#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-15 05:00:45,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1253#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-15 05:00:45,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {1253#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-15 05:00:45,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {1253#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1253#true} is VALID [2022-04-15 05:00:45,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {1253#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {1253#true} is VALID [2022-04-15 05:00:45,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {1253#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1253#true} is VALID [2022-04-15 05:00:45,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1253#true} [251] L78-->L78-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[] {1253#true} is VALID [2022-04-15 05:00:45,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {1253#true} [252] L78-2-->L82-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {1258#(= main_~lk2~0 1)} [254] L82-1-->L86-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1258#(= main_~lk2~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(= main_~lk2~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#(= main_~lk2~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(= main_~lk2~0 1)} [262] L98-1-->L102-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#(= main_~lk2~0 1)} [264] L102-1-->L106-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {1258#(= main_~lk2~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {1258#(= main_~lk2~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(= main_~lk2~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {1258#(= main_~lk2~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {1258#(= main_~lk2~0 1)} [275] L122-1-->L128-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[] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {1258#(= main_~lk2~0 1)} [278] L128-1-->L134: 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[] {1258#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:45,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#(= main_~lk2~0 1)} [282] L134-->L184-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[] {1254#false} is VALID [2022-04-15 05:00:45,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#false} is VALID [2022-04-15 05:00:45,273 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-15 05:00:45,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103260571] [2022-04-15 05:00:45,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103260571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:45,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:45,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726890872] [2022-04-15 05:00:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:45,274 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-15 05:00:45,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:45,275 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-15 05:00:45,294 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-15 05:00:45,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:45,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:45,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:45,296 INFO L87 Difference]: Start difference. First operand 86 states and 152 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-15 05:00:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,508 INFO L93 Difference]: Finished difference Result 161 states and 289 transitions. [2022-04-15 05:00:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:45,509 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-15 05:00:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:45,509 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-15 05:00:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 05:00:45,511 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-15 05:00:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 05:00:45,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 05:00:45,627 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-15 05:00:45,629 INFO L225 Difference]: With dead ends: 161 [2022-04-15 05:00:45,629 INFO L226 Difference]: Without dead ends: 159 [2022-04-15 05:00:45,629 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-15 05:00:45,630 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 195 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:45,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-15 05:00:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2022-04-15 05:00:45,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:45,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 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-15 05:00:45,635 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 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-15 05:00:45,636 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 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-15 05:00:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,639 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-15 05:00:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-15 05:00:45,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:45,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:45,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 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 159 states. [2022-04-15 05:00:45,640 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 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 159 states. [2022-04-15 05:00:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,644 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-15 05:00:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-15 05:00:45,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:45,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:45,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:45,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 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-15 05:00:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 201 transitions. [2022-04-15 05:00:45,647 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 201 transitions. Word has length 24 [2022-04-15 05:00:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:45,647 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 201 transitions. [2022-04-15 05:00:45,647 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-15 05:00:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 201 transitions. [2022-04-15 05:00:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:00:45,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:45,648 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-15 05:00:45,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 05:00:45,648 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 287928552, now seen corresponding path program 1 times [2022-04-15 05:00:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:45,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501435878] [2022-04-15 05:00:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:45,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {1883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {1877#true} is VALID [2022-04-15 05:00:45,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1877#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-15 05:00:45,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1877#true} {1877#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-15 05:00:45,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {1877#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:45,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {1883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {1877#true} is VALID [2022-04-15 05:00:45,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1877#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-15 05:00:45,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1877#true} {1877#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-15 05:00:45,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {1877#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-15 05:00:45,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {1877#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1877#true} is VALID [2022-04-15 05:00:45,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {1877#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {1877#true} is VALID [2022-04-15 05:00:45,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {1877#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1877#true} is VALID [2022-04-15 05:00:45,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#true} [251] L78-->L78-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[] {1877#true} is VALID [2022-04-15 05:00:45,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#true} [253] L78-2-->L82-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[] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {1882#(= main_~p2~0 0)} [254] L82-1-->L86-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {1882#(= main_~p2~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {1882#(= main_~p2~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {1882#(= main_~p2~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {1882#(= main_~p2~0 0)} [262] L98-1-->L102-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {1882#(= main_~p2~0 0)} [264] L102-1-->L106-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {1882#(= main_~p2~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {1882#(= main_~p2~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {1882#(= main_~p2~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {1882#(= main_~p2~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {1882#(= main_~p2~0 0)} [275] L122-1-->L128-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[] {1882#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:45,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {1882#(= main_~p2~0 0)} [278] L128-1-->L134: 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[] {1878#false} is VALID [2022-04-15 05:00:45,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {1878#false} [282] L134-->L184-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[] {1878#false} is VALID [2022-04-15 05:00:45,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {1878#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1878#false} is VALID [2022-04-15 05:00:45,690 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-15 05:00:45,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:45,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501435878] [2022-04-15 05:00:45,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501435878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:45,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:45,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:45,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505418140] [2022-04-15 05:00:45,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:45,691 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-15 05:00:45,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:45,691 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-15 05:00:45,704 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-15 05:00:45,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:45,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:45,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:45,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:45,705 INFO L87 Difference]: Start difference. First operand 113 states and 201 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-15 05:00:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,897 INFO L93 Difference]: Finished difference Result 265 states and 479 transitions. [2022-04-15 05:00:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:45,897 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-15 05:00:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:45,897 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-15 05:00:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-15 05:00:45,899 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-15 05:00:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-15 05:00:45,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions. [2022-04-15 05:00:46,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:46,057 INFO L225 Difference]: With dead ends: 265 [2022-04-15 05:00:46,059 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 05:00:46,060 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-15 05:00:46,063 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:46,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 113 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 05:00:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-15 05:00:46,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:46,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-15 05:00:46,075 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-15 05:00:46,076 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-15 05:00:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,079 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-15 05:00:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-15 05:00:46,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:46,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:46,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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 161 states. [2022-04-15 05:00:46,080 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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 161 states. [2022-04-15 05:00:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,083 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-15 05:00:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-15 05:00:46,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:46,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:46,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:46,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-15 05:00:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-15 05:00:46,087 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-15 05:00:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:46,087 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-15 05:00:46,087 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-15 05:00:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-15 05:00:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:00:46,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:46,088 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-15 05:00:46,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 05:00:46,088 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash 846416876, now seen corresponding path program 1 times [2022-04-15 05:00:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:46,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689913249] [2022-04-15 05:00:46,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {2665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {2659#true} is VALID [2022-04-15 05:00:46,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2659#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-15 05:00:46,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2659#true} {2659#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-15 05:00:46,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {2659#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:46,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {2659#true} is VALID [2022-04-15 05:00:46,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {2659#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-15 05:00:46,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2659#true} {2659#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-15 05:00:46,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {2659#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-15 05:00:46,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2659#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2659#true} is VALID [2022-04-15 05:00:46,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {2659#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {2659#true} is VALID [2022-04-15 05:00:46,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {2659#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2659#true} is VALID [2022-04-15 05:00:46,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {2659#true} [251] L78-->L78-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[] {2659#true} is VALID [2022-04-15 05:00:46,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#true} [252] L78-2-->L82-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {2664#(not (= main_~p2~0 0))} [254] L82-1-->L86-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {2664#(not (= main_~p2~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {2664#(not (= main_~p2~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {2664#(not (= main_~p2~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {2664#(not (= main_~p2~0 0))} [262] L98-1-->L102-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {2664#(not (= main_~p2~0 0))} [264] L102-1-->L106-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {2664#(not (= main_~p2~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {2664#(not (= main_~p2~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {2664#(not (= main_~p2~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {2664#(not (= main_~p2~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {2664#(not (= main_~p2~0 0))} [275] L122-1-->L128-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[] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:46,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {2664#(not (= main_~p2~0 0))} [279] L128-1-->L133-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[] {2660#false} is VALID [2022-04-15 05:00:46,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {2660#false} [284] L133-1-->L139: 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[] {2660#false} is VALID [2022-04-15 05:00:46,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {2660#false} [286] L139-->L184-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[] {2660#false} is VALID [2022-04-15 05:00:46,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {2660#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2660#false} is VALID [2022-04-15 05:00:46,166 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-15 05:00:46,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:46,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689913249] [2022-04-15 05:00:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689913249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:46,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:46,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740822693] [2022-04-15 05:00:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:46,167 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-15 05:00:46,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:46,167 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-15 05:00:46,181 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-15 05:00:46,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:46,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:46,181 INFO L87 Difference]: Start difference. First operand 159 states and 283 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-15 05:00:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,361 INFO L93 Difference]: Finished difference Result 238 states and 422 transitions. [2022-04-15 05:00:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:46,361 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-15 05:00:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:46,362 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-15 05:00:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-15 05:00:46,374 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-15 05:00:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-15 05:00:46,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-15 05:00:46,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:46,499 INFO L225 Difference]: With dead ends: 238 [2022-04-15 05:00:46,499 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 05:00:46,501 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-15 05:00:46,504 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 156 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:46,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 130 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 05:00:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-04-15 05:00:46,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:46,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 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-15 05:00:46,517 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 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-15 05:00:46,517 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 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-15 05:00:46,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,520 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-15 05:00:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-15 05:00:46,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:46,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:46,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 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 163 states. [2022-04-15 05:00:46,521 INFO L87 Difference]: Start difference. First operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 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 163 states. [2022-04-15 05:00:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,523 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-15 05:00:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-15 05:00:46,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:46,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:46,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:46,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 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-15 05:00:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 283 transitions. [2022-04-15 05:00:46,526 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 283 transitions. Word has length 25 [2022-04-15 05:00:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:46,526 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 283 transitions. [2022-04-15 05:00:46,526 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-15 05:00:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 283 transitions. [2022-04-15 05:00:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:00:46,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:46,526 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-15 05:00:46,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 05:00:46,527 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash 335882699, now seen corresponding path program 1 times [2022-04-15 05:00:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:46,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669223486] [2022-04-15 05:00:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {3420#true} is VALID [2022-04-15 05:00:46,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3420#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-15 05:00:46,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3420#true} {3420#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-15 05:00:46,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {3420#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:46,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {3420#true} is VALID [2022-04-15 05:00:46,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {3420#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-15 05:00:46,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3420#true} {3420#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-15 05:00:46,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {3420#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-15 05:00:46,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {3420#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3420#true} is VALID [2022-04-15 05:00:46,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {3420#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {3420#true} is VALID [2022-04-15 05:00:46,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {3420#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3420#true} is VALID [2022-04-15 05:00:46,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {3420#true} [251] L78-->L78-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[] {3420#true} is VALID [2022-04-15 05:00:46,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {3420#true} [253] L78-2-->L82-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[] {3420#true} is VALID [2022-04-15 05:00:46,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {3420#true} [254] L82-1-->L86-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {3425#(= main_~lk3~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {3425#(= main_~lk3~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {3425#(= main_~lk3~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {3425#(= main_~lk3~0 1)} [262] L98-1-->L102-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {3425#(= main_~lk3~0 1)} [264] L102-1-->L106-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {3425#(= main_~lk3~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {3425#(= main_~lk3~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {3425#(= main_~lk3~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {3425#(= main_~lk3~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {3425#(= main_~lk3~0 1)} [275] L122-1-->L128-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[] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {3425#(= main_~lk3~0 1)} [279] L128-1-->L133-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[] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {3425#(= main_~lk3~0 1)} [284] L133-1-->L139: 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[] {3425#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:46,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {3425#(= main_~lk3~0 1)} [286] L139-->L184-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[] {3421#false} is VALID [2022-04-15 05:00:46,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {3421#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3421#false} is VALID [2022-04-15 05:00:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:46,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669223486] [2022-04-15 05:00:46,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669223486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:46,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:46,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:46,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130367314] [2022-04-15 05:00:46,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:46,565 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-15 05:00:46,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:46,565 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-15 05:00:46,578 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-15 05:00:46,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:46,579 INFO L87 Difference]: Start difference. First operand 161 states and 283 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-15 05:00:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,749 INFO L93 Difference]: Finished difference Result 301 states and 537 transitions. [2022-04-15 05:00:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:46,750 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-15 05:00:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:46,750 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-15 05:00:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 05:00:46,752 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-15 05:00:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 05:00:46,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 05:00:46,846 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-15 05:00:46,852 INFO L225 Difference]: With dead ends: 301 [2022-04-15 05:00:46,852 INFO L226 Difference]: Without dead ends: 299 [2022-04-15 05:00:46,852 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-15 05:00:46,853 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:46,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-15 05:00:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 217. [2022-04-15 05:00:46,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:46,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 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-15 05:00:46,861 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 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-15 05:00:46,862 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 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-15 05:00:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,867 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-15 05:00:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-15 05:00:46,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:46,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:46,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 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 299 states. [2022-04-15 05:00:46,868 INFO L87 Difference]: Start difference. First operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 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 299 states. [2022-04-15 05:00:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:46,873 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-15 05:00:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-15 05:00:46,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:46,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:46,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:46,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 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-15 05:00:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 379 transitions. [2022-04-15 05:00:46,876 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 379 transitions. Word has length 25 [2022-04-15 05:00:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:46,877 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 379 transitions. [2022-04-15 05:00:46,877 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-15 05:00:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 379 transitions. [2022-04-15 05:00:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:00:46,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:46,879 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-15 05:00:46,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 05:00:46,879 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1843434508, now seen corresponding path program 1 times [2022-04-15 05:00:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:46,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946861395] [2022-04-15 05:00:46,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:46,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {4580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {4574#true} is VALID [2022-04-15 05:00:46,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {4574#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-15 05:00:46,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4574#true} {4574#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-15 05:00:46,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {4574#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:46,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {4580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {4574#true} is VALID [2022-04-15 05:00:46,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {4574#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-15 05:00:46,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4574#true} {4574#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-15 05:00:46,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {4574#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-15 05:00:46,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {4574#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4574#true} is VALID [2022-04-15 05:00:46,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {4574#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {4574#true} is VALID [2022-04-15 05:00:46,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {4574#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {4574#true} is VALID [2022-04-15 05:00:46,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {4574#true} [251] L78-->L78-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[] {4574#true} is VALID [2022-04-15 05:00:46,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {4574#true} [253] L78-2-->L82-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[] {4574#true} is VALID [2022-04-15 05:00:46,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {4574#true} [255] L82-1-->L86-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[] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {4579#(= main_~p3~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {4579#(= main_~p3~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {4579#(= main_~p3~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {4579#(= main_~p3~0 0)} [262] L98-1-->L102-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {4579#(= main_~p3~0 0)} [264] L102-1-->L106-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {4579#(= main_~p3~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {4579#(= main_~p3~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {4579#(= main_~p3~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {4579#(= main_~p3~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {4579#(= main_~p3~0 0)} [275] L122-1-->L128-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[] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {4579#(= main_~p3~0 0)} [279] L128-1-->L133-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[] {4579#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:46,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {4579#(= main_~p3~0 0)} [284] L133-1-->L139: 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[] {4575#false} is VALID [2022-04-15 05:00:46,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {4575#false} [286] L139-->L184-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[] {4575#false} is VALID [2022-04-15 05:00:46,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {4575#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4575#false} is VALID [2022-04-15 05:00:46,954 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-15 05:00:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:46,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946861395] [2022-04-15 05:00:46,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946861395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:46,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:46,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:46,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096810588] [2022-04-15 05:00:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:46,955 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-15 05:00:46,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:46,955 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-15 05:00:46,982 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-15 05:00:46,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:46,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:46,983 INFO L87 Difference]: Start difference. First operand 217 states and 379 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-15 05:00:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:47,221 INFO L93 Difference]: Finished difference Result 513 states and 905 transitions. [2022-04-15 05:00:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:47,221 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-15 05:00:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:47,222 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-15 05:00:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 05:00:47,223 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-15 05:00:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 05:00:47,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-15 05:00:47,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:47,361 INFO L225 Difference]: With dead ends: 513 [2022-04-15 05:00:47,361 INFO L226 Difference]: Without dead ends: 307 [2022-04-15 05:00:47,363 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-15 05:00:47,363 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:47,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-15 05:00:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-15 05:00:47,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:47,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 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-15 05:00:47,375 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 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-15 05:00:47,376 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 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-15 05:00:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:47,381 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-15 05:00:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-15 05:00:47,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:47,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:47,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 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 307 states. [2022-04-15 05:00:47,382 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 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 307 states. [2022-04-15 05:00:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:47,387 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-15 05:00:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-15 05:00:47,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:47,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:47,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:47,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 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-15 05:00:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 531 transitions. [2022-04-15 05:00:47,392 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 531 transitions. Word has length 25 [2022-04-15 05:00:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:47,392 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 531 transitions. [2022-04-15 05:00:47,392 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-15 05:00:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 531 transitions. [2022-04-15 05:00:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:00:47,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:47,393 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-15 05:00:47,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 05:00:47,393 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1822461380, now seen corresponding path program 1 times [2022-04-15 05:00:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:47,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933634990] [2022-04-15 05:00:47,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:47,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:47,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {6058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {6052#true} is VALID [2022-04-15 05:00:47,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {6052#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 05:00:47,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6052#true} {6052#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 05:00:47,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {6052#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:47,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {6058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {6052#true} is VALID [2022-04-15 05:00:47,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {6052#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 05:00:47,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6052#true} {6052#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 05:00:47,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {6052#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-15 05:00:47,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {6052#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6052#true} is VALID [2022-04-15 05:00:47,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {6052#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {6052#true} is VALID [2022-04-15 05:00:47,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {6052#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {6052#true} is VALID [2022-04-15 05:00:47,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {6052#true} [251] L78-->L78-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[] {6052#true} is VALID [2022-04-15 05:00:47,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#true} [253] L78-2-->L82-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[] {6052#true} is VALID [2022-04-15 05:00:47,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {6052#true} [254] L82-1-->L86-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {6057#(not (= main_~p3~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {6057#(not (= main_~p3~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {6057#(not (= main_~p3~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {6057#(not (= main_~p3~0 0))} [262] L98-1-->L102-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {6057#(not (= main_~p3~0 0))} [264] L102-1-->L106-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {6057#(not (= main_~p3~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {6057#(not (= main_~p3~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {6057#(not (= main_~p3~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {6057#(not (= main_~p3~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {6057#(not (= main_~p3~0 0))} [275] L122-1-->L128-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[] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {6057#(not (= main_~p3~0 0))} [279] L128-1-->L133-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[] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:47,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {6057#(not (= main_~p3~0 0))} [285] L133-1-->L138-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[] {6053#false} is VALID [2022-04-15 05:00:47,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {6053#false} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {6053#false} is VALID [2022-04-15 05:00:47,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {6053#false} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {6053#false} is VALID [2022-04-15 05:00:47,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {6053#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6053#false} is VALID [2022-04-15 05:00:47,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-15 05:00:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:47,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933634990] [2022-04-15 05:00:47,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933634990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:47,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:47,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383910943] [2022-04-15 05:00:47,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:47,461 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-15 05:00:47,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:47,461 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-15 05:00:47,482 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-15 05:00:47,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:47,483 INFO L87 Difference]: Start difference. First operand 305 states and 531 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-15 05:00:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:47,634 INFO L93 Difference]: Finished difference Result 457 states and 793 transitions. [2022-04-15 05:00:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:47,634 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-15 05:00:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:47,634 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-15 05:00:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 05:00:47,636 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-15 05:00:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 05:00:47,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-15 05:00:47,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:47,765 INFO L225 Difference]: With dead ends: 457 [2022-04-15 05:00:47,765 INFO L226 Difference]: Without dead ends: 311 [2022-04-15 05:00:47,766 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-15 05:00:47,768 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:47,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-15 05:00:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-15 05:00:47,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:47,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 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-15 05:00:47,773 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 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-15 05:00:47,774 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 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-15 05:00:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:47,779 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-15 05:00:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-15 05:00:47,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:47,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:47,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 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 311 states. [2022-04-15 05:00:47,781 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 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 311 states. [2022-04-15 05:00:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:47,786 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-15 05:00:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-15 05:00:47,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:47,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:47,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:47,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 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-15 05:00:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 531 transitions. [2022-04-15 05:00:47,791 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 531 transitions. Word has length 26 [2022-04-15 05:00:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:47,791 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 531 transitions. [2022-04-15 05:00:47,791 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-15 05:00:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 531 transitions. [2022-04-15 05:00:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:00:47,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:47,792 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-15 05:00:47,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 05:00:47,792 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1311927203, now seen corresponding path program 1 times [2022-04-15 05:00:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:47,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163937141] [2022-04-15 05:00:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:47,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:47,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:47,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {7486#true} is VALID [2022-04-15 05:00:47,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {7486#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-15 05:00:47,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7486#true} {7486#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-15 05:00:47,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {7486#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:47,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {7486#true} is VALID [2022-04-15 05:00:47,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {7486#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-15 05:00:47,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-15 05:00:47,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {7486#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-15 05:00:47,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {7486#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {7486#true} is VALID [2022-04-15 05:00:47,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {7486#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {7486#true} is VALID [2022-04-15 05:00:47,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {7486#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {7486#true} is VALID [2022-04-15 05:00:47,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {7486#true} [251] L78-->L78-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[] {7486#true} is VALID [2022-04-15 05:00:47,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {7486#true} [253] L78-2-->L82-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[] {7486#true} is VALID [2022-04-15 05:00:47,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {7486#true} [255] L82-1-->L86-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[] {7486#true} is VALID [2022-04-15 05:00:47,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {7486#true} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {7491#(= main_~lk4~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {7491#(= main_~lk4~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {7491#(= main_~lk4~0 1)} [262] L98-1-->L102-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {7491#(= main_~lk4~0 1)} [264] L102-1-->L106-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {7491#(= main_~lk4~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {7491#(= main_~lk4~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {7491#(= main_~lk4~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {7491#(= main_~lk4~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {7491#(= main_~lk4~0 1)} [275] L122-1-->L128-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[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {7491#(= main_~lk4~0 1)} [279] L128-1-->L133-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[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {7491#(= main_~lk4~0 1)} [285] L133-1-->L138-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[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {7491#(= main_~lk4~0 1)} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:47,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {7491#(= main_~lk4~0 1)} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {7487#false} is VALID [2022-04-15 05:00:47,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {7487#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7487#false} is VALID [2022-04-15 05:00:47,836 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-15 05:00:47,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:47,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163937141] [2022-04-15 05:00:47,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163937141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:47,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:47,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322644652] [2022-04-15 05:00:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:47,837 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-15 05:00:47,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:47,837 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-15 05:00:47,851 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-15 05:00:47,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:47,851 INFO L87 Difference]: Start difference. First operand 309 states and 531 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-15 05:00:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,032 INFO L93 Difference]: Finished difference Result 573 states and 1001 transitions. [2022-04-15 05:00:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:48,032 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-15 05:00:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:48,032 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-15 05:00:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 05:00:48,033 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-15 05:00:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 05:00:48,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-15 05:00:48,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:48,135 INFO L225 Difference]: With dead ends: 573 [2022-04-15 05:00:48,135 INFO L226 Difference]: Without dead ends: 571 [2022-04-15 05:00:48,135 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-15 05:00:48,135 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:48,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-15 05:00:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-15 05:00:48,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:48,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 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-15 05:00:48,143 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 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-15 05:00:48,144 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 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-15 05:00:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,156 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-15 05:00:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-15 05:00:48,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:48,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:48,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 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 571 states. [2022-04-15 05:00:48,158 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 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 571 states. [2022-04-15 05:00:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,170 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-15 05:00:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-15 05:00:48,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:48,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:48,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:48,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 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-15 05:00:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 719 transitions. [2022-04-15 05:00:48,178 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 719 transitions. Word has length 26 [2022-04-15 05:00:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:48,179 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 719 transitions. [2022-04-15 05:00:48,179 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-15 05:00:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 719 transitions. [2022-04-15 05:00:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:00:48,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:48,179 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-15 05:00:48,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 05:00:48,179 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1475488284, now seen corresponding path program 1 times [2022-04-15 05:00:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:48,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38491824] [2022-04-15 05:00:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:48,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {9682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {9676#true} is VALID [2022-04-15 05:00:48,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {9676#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-15 05:00:48,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9676#true} {9676#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {9676#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:48,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {9682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {9676#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9676#true} {9676#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {9676#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {9676#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {9676#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {9676#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {9676#true} is VALID [2022-04-15 05:00:48,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {9676#true} [251] L78-->L78-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[] {9676#true} is VALID [2022-04-15 05:00:48,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {9676#true} [253] L78-2-->L82-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[] {9676#true} is VALID [2022-04-15 05:00:48,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {9676#true} [255] L82-1-->L86-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[] {9676#true} is VALID [2022-04-15 05:00:48,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {9676#true} [257] L86-1-->L90-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {9681#(= main_~p4~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {9681#(= main_~p4~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {9681#(= main_~p4~0 0)} [262] L98-1-->L102-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {9681#(= main_~p4~0 0)} [264] L102-1-->L106-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {9681#(= main_~p4~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {9681#(= main_~p4~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {9681#(= main_~p4~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {9681#(= main_~p4~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {9681#(= main_~p4~0 0)} [275] L122-1-->L128-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {9681#(= main_~p4~0 0)} [279] L128-1-->L133-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {9681#(= main_~p4~0 0)} [285] L133-1-->L138-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:48,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {9681#(= main_~p4~0 0)} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {9677#false} is VALID [2022-04-15 05:00:48,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {9677#false} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {9677#false} is VALID [2022-04-15 05:00:48,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {9677#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9677#false} is VALID [2022-04-15 05:00:48,223 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-15 05:00:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:48,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38491824] [2022-04-15 05:00:48,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38491824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:48,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:48,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108806875] [2022-04-15 05:00:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:48,224 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-15 05:00:48,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:48,224 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-15 05:00:48,237 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-15 05:00:48,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:48,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:48,238 INFO L87 Difference]: Start difference. First operand 425 states and 719 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-15 05:00:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,427 INFO L93 Difference]: Finished difference Result 1005 states and 1713 transitions. [2022-04-15 05:00:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:48,427 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-15 05:00:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:48,427 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-15 05:00:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-15 05:00:48,428 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-15 05:00:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-15 05:00:48,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2022-04-15 05:00:48,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:48,571 INFO L225 Difference]: With dead ends: 1005 [2022-04-15 05:00:48,572 INFO L226 Difference]: Without dead ends: 595 [2022-04-15 05:00:48,572 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-15 05:00:48,573 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:48,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-15 05:00:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-15 05:00:48,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:48,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 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-15 05:00:48,582 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 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-15 05:00:48,583 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 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-15 05:00:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,595 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-15 05:00:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-15 05:00:48,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:48,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:48,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 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 595 states. [2022-04-15 05:00:48,597 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 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 595 states. [2022-04-15 05:00:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,609 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-15 05:00:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-15 05:00:48,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:48,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:48,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:48,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 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-15 05:00:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 999 transitions. [2022-04-15 05:00:48,623 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 999 transitions. Word has length 26 [2022-04-15 05:00:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:48,623 INFO L478 AbstractCegarLoop]: Abstraction has 593 states and 999 transitions. [2022-04-15 05:00:48,623 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-15 05:00:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 999 transitions. [2022-04-15 05:00:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:00:48,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:48,624 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, 1] [2022-04-15 05:00:48,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 05:00:48,624 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2015070056, now seen corresponding path program 1 times [2022-04-15 05:00:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:48,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280265148] [2022-04-15 05:00:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:48,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:48,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:48,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {12536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {12530#true} is VALID [2022-04-15 05:00:48,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {12530#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-15 05:00:48,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12530#true} {12530#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-15 05:00:48,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {12530#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:48,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {12536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {12530#true} is VALID [2022-04-15 05:00:48,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {12530#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-15 05:00:48,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12530#true} {12530#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-15 05:00:48,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {12530#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-15 05:00:48,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {12530#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {12530#true} is VALID [2022-04-15 05:00:48,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {12530#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {12530#true} is VALID [2022-04-15 05:00:48,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {12530#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {12530#true} is VALID [2022-04-15 05:00:48,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {12530#true} [251] L78-->L78-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[] {12530#true} is VALID [2022-04-15 05:00:48,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {12530#true} [253] L78-2-->L82-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[] {12530#true} is VALID [2022-04-15 05:00:48,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {12530#true} [255] L82-1-->L86-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[] {12530#true} is VALID [2022-04-15 05:00:48,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {12530#true} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {12535#(not (= main_~p4~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {12535#(not (= main_~p4~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {12535#(not (= main_~p4~0 0))} [262] L98-1-->L102-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {12535#(not (= main_~p4~0 0))} [264] L102-1-->L106-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {12535#(not (= main_~p4~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {12535#(not (= main_~p4~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {12535#(not (= main_~p4~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {12535#(not (= main_~p4~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {12535#(not (= main_~p4~0 0))} [275] L122-1-->L128-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[] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {12535#(not (= main_~p4~0 0))} [279] L128-1-->L133-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[] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {12535#(not (= main_~p4~0 0))} [285] L133-1-->L138-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[] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:48,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {12535#(not (= main_~p4~0 0))} [289] L138-1-->L143-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[] {12531#false} is VALID [2022-04-15 05:00:48,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {12531#false} [292] L143-1-->L149: Formula: (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} AuxVars[] AssignedVars[] {12531#false} is VALID [2022-04-15 05:00:48,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {12531#false} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {12531#false} is VALID [2022-04-15 05:00:48,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {12531#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12531#false} is VALID [2022-04-15 05:00:48,657 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-15 05:00:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:48,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280265148] [2022-04-15 05:00:48,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280265148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:48,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:48,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211033633] [2022-04-15 05:00:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-15 05:00:48,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:48,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:48,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:48,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:48,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:48,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:48,673 INFO L87 Difference]: Start difference. First operand 593 states and 999 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,847 INFO L93 Difference]: Finished difference Result 889 states and 1493 transitions. [2022-04-15 05:00:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-15 05:00:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-15 05:00:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-15 05:00:48,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions. [2022-04-15 05:00:48,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:48,997 INFO L225 Difference]: With dead ends: 889 [2022-04-15 05:00:48,997 INFO L226 Difference]: Without dead ends: 603 [2022-04-15 05:00:48,997 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-15 05:00:48,998 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:48,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-15 05:00:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-15 05:00:49,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:49,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 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-15 05:00:49,009 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 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-15 05:00:49,009 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 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-15 05:00:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:49,023 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-15 05:00:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-15 05:00:49,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:49,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:49,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 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 603 states. [2022-04-15 05:00:49,025 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 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 603 states. [2022-04-15 05:00:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:49,038 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-15 05:00:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-15 05:00:49,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:49,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:49,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:49,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 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-15 05:00:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 999 transitions. [2022-04-15 05:00:49,053 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 999 transitions. Word has length 27 [2022-04-15 05:00:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:49,053 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 999 transitions. [2022-04-15 05:00:49,053 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 999 transitions. [2022-04-15 05:00:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:00:49,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:49,054 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, 1] [2022-04-15 05:00:49,054 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 05:00:49,054 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1504535879, now seen corresponding path program 1 times [2022-04-15 05:00:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:49,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894371474] [2022-04-15 05:00:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:49,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {15298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {15292#true} is VALID [2022-04-15 05:00:49,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {15292#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-15 05:00:49,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15292#true} {15292#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-15 05:00:49,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {15292#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:49,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {15298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {15292#true} is VALID [2022-04-15 05:00:49,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {15292#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-15 05:00:49,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15292#true} {15292#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-15 05:00:49,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {15292#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-15 05:00:49,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {15292#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {15292#true} is VALID [2022-04-15 05:00:49,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {15292#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {15292#true} is VALID [2022-04-15 05:00:49,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {15292#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {15292#true} is VALID [2022-04-15 05:00:49,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {15292#true} [251] L78-->L78-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[] {15292#true} is VALID [2022-04-15 05:00:49,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {15292#true} [253] L78-2-->L82-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[] {15292#true} is VALID [2022-04-15 05:00:49,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {15292#true} [255] L82-1-->L86-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[] {15292#true} is VALID [2022-04-15 05:00:49,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {15292#true} [257] L86-1-->L90-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[] {15292#true} is VALID [2022-04-15 05:00:49,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {15292#true} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {15297#(= main_~lk5~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {15297#(= main_~lk5~0 1)} [262] L98-1-->L102-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {15297#(= main_~lk5~0 1)} [264] L102-1-->L106-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {15297#(= main_~lk5~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {15297#(= main_~lk5~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {15297#(= main_~lk5~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {15297#(= main_~lk5~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {15297#(= main_~lk5~0 1)} [275] L122-1-->L128-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {15297#(= main_~lk5~0 1)} [279] L128-1-->L133-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {15297#(= main_~lk5~0 1)} [285] L133-1-->L138-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {15297#(= main_~lk5~0 1)} [289] L138-1-->L143-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {15297#(= main_~lk5~0 1)} [292] L143-1-->L149: Formula: (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} AuxVars[] AssignedVars[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:49,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {15297#(= main_~lk5~0 1)} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {15293#false} is VALID [2022-04-15 05:00:49,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {15293#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15293#false} is VALID [2022-04-15 05:00:49,090 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-15 05:00:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:49,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894371474] [2022-04-15 05:00:49,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894371474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:49,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:49,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142401151] [2022-04-15 05:00:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-15 05:00:49,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:49,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:49,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:49,106 INFO L87 Difference]: Start difference. First operand 601 states and 999 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:49,288 INFO L93 Difference]: Finished difference Result 1101 states and 1865 transitions. [2022-04-15 05:00:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-15 05:00:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 05:00:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 05:00:49,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-15 05:00:49,372 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-15 05:00:49,407 INFO L225 Difference]: With dead ends: 1101 [2022-04-15 05:00:49,407 INFO L226 Difference]: Without dead ends: 1099 [2022-04-15 05:00:49,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-15 05:00:49,408 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:49,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-15 05:00:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-15 05:00:49,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:49,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 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-15 05:00:49,421 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 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-15 05:00:49,422 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 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-15 05:00:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:49,457 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-15 05:00:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-15 05:00:49,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:49,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:49,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 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 1099 states. [2022-04-15 05:00:49,461 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 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 1099 states. [2022-04-15 05:00:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:49,497 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-15 05:00:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-15 05:00:49,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:49,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:49,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:49,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 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-15 05:00:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1367 transitions. [2022-04-15 05:00:49,522 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1367 transitions. Word has length 27 [2022-04-15 05:00:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:49,522 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1367 transitions. [2022-04-15 05:00:49,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1367 transitions. [2022-04-15 05:00:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:00:49,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:49,527 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, 1] [2022-04-15 05:00:49,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 05:00:49,527 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1282879608, now seen corresponding path program 1 times [2022-04-15 05:00:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563312881] [2022-04-15 05:00:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:49,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {19512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {19506#true} is VALID [2022-04-15 05:00:49,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {19506#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-15 05:00:49,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19506#true} {19506#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-15 05:00:49,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {19506#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:49,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {19512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {19506#true} is VALID [2022-04-15 05:00:49,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {19506#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-15 05:00:49,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19506#true} {19506#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-15 05:00:49,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {19506#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-15 05:00:49,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {19506#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {19506#true} is VALID [2022-04-15 05:00:49,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {19506#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {19506#true} is VALID [2022-04-15 05:00:49,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {19506#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {19506#true} is VALID [2022-04-15 05:00:49,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {19506#true} [251] L78-->L78-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[] {19506#true} is VALID [2022-04-15 05:00:49,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {19506#true} [253] L78-2-->L82-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[] {19506#true} is VALID [2022-04-15 05:00:49,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {19506#true} [255] L82-1-->L86-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[] {19506#true} is VALID [2022-04-15 05:00:49,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {19506#true} [257] L86-1-->L90-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[] {19506#true} is VALID [2022-04-15 05:00:49,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {19506#true} [259] L90-1-->L94-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {19511#(= main_~p5~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {19511#(= main_~p5~0 0)} [262] L98-1-->L102-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] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {19511#(= main_~p5~0 0)} [264] L102-1-->L106-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] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {19511#(= main_~p5~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {19511#(= main_~p5~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {19511#(= main_~p5~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {19511#(= main_~p5~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {19511#(= main_~p5~0 0)} [275] L122-1-->L128-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {19511#(= main_~p5~0 0)} [279] L128-1-->L133-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {19511#(= main_~p5~0 0)} [285] L133-1-->L138-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {19511#(= main_~p5~0 0)} [289] L138-1-->L143-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:49,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {19511#(= main_~p5~0 0)} [292] L143-1-->L149: Formula: (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} AuxVars[] AssignedVars[] {19507#false} is VALID [2022-04-15 05:00:49,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {19507#false} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {19507#false} is VALID [2022-04-15 05:00:49,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {19507#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19507#false} is VALID [2022-04-15 05:00:49,576 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-15 05:00:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:49,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563312881] [2022-04-15 05:00:49,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563312881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:49,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:49,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90089008] [2022-04-15 05:00:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:49,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-15 05:00:49,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:49,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:49,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:49,592 INFO L87 Difference]: Start difference. First operand 841 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:49,846 INFO L93 Difference]: Finished difference Result 1981 states and 3241 transitions. [2022-04-15 05:00:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:49,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-15 05:00:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-15 05:00:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-15 05:00:49,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2022-04-15 05:00:49,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:50,014 INFO L225 Difference]: With dead ends: 1981 [2022-04-15 05:00:50,014 INFO L226 Difference]: Without dead ends: 1163 [2022-04-15 05:00:50,016 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-15 05:00:50,016 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:50,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-15 05:00:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-15 05:00:50,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:50,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 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-15 05:00:50,036 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 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-15 05:00:50,037 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 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-15 05:00:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:50,119 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-15 05:00:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-15 05:00:50,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:50,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:50,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 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 1163 states. [2022-04-15 05:00:50,123 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 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 1163 states. [2022-04-15 05:00:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:50,193 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-15 05:00:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-15 05:00:50,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:50,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:50,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:50,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 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-15 05:00:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1879 transitions. [2022-04-15 05:00:50,238 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1879 transitions. Word has length 27 [2022-04-15 05:00:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:50,238 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1879 transitions. [2022-04-15 05:00:50,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 05:00:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1879 transitions. [2022-04-15 05:00:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:00:50,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:50,240 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, 1, 1] [2022-04-15 05:00:50,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 05:00:50,240 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash -603995456, now seen corresponding path program 1 times [2022-04-15 05:00:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:50,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901848797] [2022-04-15 05:00:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:50,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:50,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {25086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {25080#true} is VALID [2022-04-15 05:00:50,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {25080#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-15 05:00:50,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25080#true} {25080#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-15 05:00:50,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {25080#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:50,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {25086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {25080#true} is VALID [2022-04-15 05:00:50,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {25080#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-15 05:00:50,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25080#true} {25080#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-15 05:00:50,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {25080#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-15 05:00:50,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {25080#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {25080#true} is VALID [2022-04-15 05:00:50,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {25080#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {25080#true} is VALID [2022-04-15 05:00:50,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {25080#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {25080#true} is VALID [2022-04-15 05:00:50,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {25080#true} [251] L78-->L78-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[] {25080#true} is VALID [2022-04-15 05:00:50,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {25080#true} [253] L78-2-->L82-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[] {25080#true} is VALID [2022-04-15 05:00:50,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {25080#true} [255] L82-1-->L86-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[] {25080#true} is VALID [2022-04-15 05:00:50,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {25080#true} [257] L86-1-->L90-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[] {25080#true} is VALID [2022-04-15 05:00:50,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {25080#true} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (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, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {25085#(not (= main_~p5~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {25085#(not (= main_~p5~0 0))} [262] L98-1-->L102-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {25085#(not (= main_~p5~0 0))} [264] L102-1-->L106-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {25085#(not (= main_~p5~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {25085#(not (= main_~p5~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {25085#(not (= main_~p5~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {25085#(not (= main_~p5~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {25085#(not (= main_~p5~0 0))} [275] L122-1-->L128-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {25085#(not (= main_~p5~0 0))} [279] L128-1-->L133-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {25085#(not (= main_~p5~0 0))} [285] L133-1-->L138-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {25085#(not (= main_~p5~0 0))} [289] L138-1-->L143-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:50,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {25085#(not (= main_~p5~0 0))} [293] L143-1-->L148-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[] {25081#false} is VALID [2022-04-15 05:00:50,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {25081#false} [296] L148-1-->L154: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {25081#false} is VALID [2022-04-15 05:00:50,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {25081#false} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {25081#false} is VALID [2022-04-15 05:00:50,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {25081#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25081#false} is VALID [2022-04-15 05:00:50,282 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-15 05:00:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:50,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901848797] [2022-04-15 05:00:50,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901848797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:50,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:50,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830937652] [2022-04-15 05:00:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-15 05:00:50,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:50,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:50,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:50,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:50,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:50,297 INFO L87 Difference]: Start difference. First operand 1161 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:50,522 INFO L93 Difference]: Finished difference Result 1741 states and 2809 transitions. [2022-04-15 05:00:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:50,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-15 05:00:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 05:00:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 05:00:50,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-15 05:00:50,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:50,683 INFO L225 Difference]: With dead ends: 1741 [2022-04-15 05:00:50,683 INFO L226 Difference]: Without dead ends: 1179 [2022-04-15 05:00:50,685 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-15 05:00:50,686 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:50,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-15 05:00:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-15 05:00:50,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:50,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 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-15 05:00:50,705 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 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-15 05:00:50,706 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 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-15 05:00:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:50,748 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-15 05:00:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-15 05:00:50,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:50,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:50,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 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 1179 states. [2022-04-15 05:00:50,752 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 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 1179 states. [2022-04-15 05:00:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:50,793 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-15 05:00:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-15 05:00:50,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:50,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:50,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:50,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 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-15 05:00:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1879 transitions. [2022-04-15 05:00:50,839 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1879 transitions. Word has length 28 [2022-04-15 05:00:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:50,839 INFO L478 AbstractCegarLoop]: Abstraction has 1177 states and 1879 transitions. [2022-04-15 05:00:50,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1879 transitions. [2022-04-15 05:00:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:00:50,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:50,841 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, 1, 1] [2022-04-15 05:00:50,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 05:00:50,841 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1114529633, now seen corresponding path program 1 times [2022-04-15 05:00:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:50,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458192273] [2022-04-15 05:00:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:50,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:50,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {30468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {30462#true} is VALID [2022-04-15 05:00:50,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {30462#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-15 05:00:50,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30462#true} {30462#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-15 05:00:50,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {30462#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:50,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {30468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {30462#true} is VALID [2022-04-15 05:00:50,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {30462#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-15 05:00:50,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30462#true} {30462#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-15 05:00:50,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {30462#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-15 05:00:50,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {30462#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {30462#true} is VALID [2022-04-15 05:00:50,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {30462#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {30462#true} is VALID [2022-04-15 05:00:50,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {30462#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {30462#true} is VALID [2022-04-15 05:00:50,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {30462#true} [251] L78-->L78-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[] {30462#true} is VALID [2022-04-15 05:00:50,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {30462#true} [253] L78-2-->L82-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[] {30462#true} is VALID [2022-04-15 05:00:50,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {30462#true} [255] L82-1-->L86-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[] {30462#true} is VALID [2022-04-15 05:00:50,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {30462#true} [257] L86-1-->L90-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[] {30462#true} is VALID [2022-04-15 05:00:50,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {30462#true} [259] L90-1-->L94-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[] {30462#true} is VALID [2022-04-15 05:00:50,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {30462#true} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {30467#(= main_~lk6~0 1)} [262] L98-1-->L102-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] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {30467#(= main_~lk6~0 1)} [264] L102-1-->L106-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] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {30467#(= main_~lk6~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {30467#(= main_~lk6~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {30467#(= main_~lk6~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {30467#(= main_~lk6~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {30467#(= main_~lk6~0 1)} [275] L122-1-->L128-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {30467#(= main_~lk6~0 1)} [279] L128-1-->L133-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {30467#(= main_~lk6~0 1)} [285] L133-1-->L138-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {30467#(= main_~lk6~0 1)} [289] L138-1-->L143-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {30467#(= main_~lk6~0 1)} [293] L143-1-->L148-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {30467#(= main_~lk6~0 1)} [296] L148-1-->L154: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:50,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {30467#(= main_~lk6~0 1)} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {30463#false} is VALID [2022-04-15 05:00:50,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {30463#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30463#false} is VALID [2022-04-15 05:00:50,889 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-15 05:00:50,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:50,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458192273] [2022-04-15 05:00:50,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458192273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:50,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:50,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:50,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183053389] [2022-04-15 05:00:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:50,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-15 05:00:50,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:50,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:50,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:50,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:50,907 INFO L87 Difference]: Start difference. First operand 1177 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:51,176 INFO L93 Difference]: Finished difference Result 2125 states and 3465 transitions. [2022-04-15 05:00:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-15 05:00:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 05:00:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 05:00:51,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-15 05:00:51,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:51,390 INFO L225 Difference]: With dead ends: 2125 [2022-04-15 05:00:51,391 INFO L226 Difference]: Without dead ends: 2123 [2022-04-15 05:00:51,391 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-15 05:00:51,392 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:51,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-15 05:00:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-15 05:00:51,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:51,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 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-15 05:00:51,438 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 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-15 05:00:51,439 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 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-15 05:00:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:51,558 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-15 05:00:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-15 05:00:51,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:51,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:51,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 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 2123 states. [2022-04-15 05:00:51,565 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 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 2123 states. [2022-04-15 05:00:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:51,692 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-15 05:00:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-15 05:00:51,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:51,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:51,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:51,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 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-15 05:00:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2599 transitions. [2022-04-15 05:00:51,778 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2599 transitions. Word has length 28 [2022-04-15 05:00:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:51,778 INFO L478 AbstractCegarLoop]: Abstraction has 1673 states and 2599 transitions. [2022-04-15 05:00:51,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2599 transitions. [2022-04-15 05:00:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:00:51,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:51,780 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, 1, 1] [2022-04-15 05:00:51,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 05:00:51,780 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 393022176, now seen corresponding path program 1 times [2022-04-15 05:00:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:51,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558458819] [2022-04-15 05:00:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:51,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {38634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {38628#true} is VALID [2022-04-15 05:00:51,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {38628#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-15 05:00:51,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38628#true} {38628#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-15 05:00:51,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {38628#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {38634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {38628#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38628#true} {38628#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {38628#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {38628#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {38628#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {38628#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {38628#true} [251] L78-->L78-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[] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {38628#true} [253] L78-2-->L82-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[] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {38628#true} [255] L82-1-->L86-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[] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {38628#true} [257] L86-1-->L90-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[] {38628#true} is VALID [2022-04-15 05:00:51,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {38628#true} [259] L90-1-->L94-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[] {38628#true} is VALID [2022-04-15 05:00:51,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {38628#true} [261] L94-1-->L98-1: Formula: (= 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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {38633#(= main_~p6~0 0)} [262] L98-1-->L102-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] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {38633#(= main_~p6~0 0)} [264] L102-1-->L106-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] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {38633#(= main_~p6~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {38633#(= main_~p6~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {38633#(= main_~p6~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {38633#(= main_~p6~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {38633#(= main_~p6~0 0)} [275] L122-1-->L128-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {38633#(= main_~p6~0 0)} [279] L128-1-->L133-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {38633#(= main_~p6~0 0)} [285] L133-1-->L138-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {38633#(= main_~p6~0 0)} [289] L138-1-->L143-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {38633#(= main_~p6~0 0)} [293] L143-1-->L148-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:51,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {38633#(= main_~p6~0 0)} [296] L148-1-->L154: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {38629#false} is VALID [2022-04-15 05:00:51,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {38629#false} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {38629#false} is VALID [2022-04-15 05:00:51,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {38629#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38629#false} is VALID [2022-04-15 05:00:51,817 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-15 05:00:51,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:51,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558458819] [2022-04-15 05:00:51,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558458819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:51,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:51,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685415134] [2022-04-15 05:00:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-15 05:00:51,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:51,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:51,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:51,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:51,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:51,833 INFO L87 Difference]: Start difference. First operand 1673 states and 2599 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:52,427 INFO L93 Difference]: Finished difference Result 3917 states and 6121 transitions. [2022-04-15 05:00:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:52,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-15 05:00:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-15 05:00:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-15 05:00:52,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-04-15 05:00:52,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:52,701 INFO L225 Difference]: With dead ends: 3917 [2022-04-15 05:00:52,701 INFO L226 Difference]: Without dead ends: 2283 [2022-04-15 05:00:52,704 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-15 05:00:52,704 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:52,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-15 05:00:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-15 05:00:52,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:52,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 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-15 05:00:52,751 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 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-15 05:00:52,754 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 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-15 05:00:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:52,906 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-15 05:00:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-15 05:00:52,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:52,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:52,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 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 2283 states. [2022-04-15 05:00:52,916 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 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 2283 states. [2022-04-15 05:00:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:53,127 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-15 05:00:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-15 05:00:53,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:53,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:53,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:53,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 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-15 05:00:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3527 transitions. [2022-04-15 05:00:53,268 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3527 transitions. Word has length 28 [2022-04-15 05:00:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:53,268 INFO L478 AbstractCegarLoop]: Abstraction has 2281 states and 3527 transitions. [2022-04-15 05:00:53,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-15 05:00:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3527 transitions. [2022-04-15 05:00:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:00:53,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:53,269 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, 1, 1, 1] [2022-04-15 05:00:53,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 05:00:53,270 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash -190647580, now seen corresponding path program 1 times [2022-04-15 05:00:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:53,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440709120] [2022-04-15 05:00:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:53,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {49584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {49578#true} is VALID [2022-04-15 05:00:53,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {49578#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-15 05:00:53,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49578#true} {49578#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-15 05:00:53,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {49578#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:53,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {49584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {49578#true} is VALID [2022-04-15 05:00:53,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {49578#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-15 05:00:53,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49578#true} {49578#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-15 05:00:53,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {49578#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-15 05:00:53,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {49578#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {49578#true} is VALID [2022-04-15 05:00:53,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {49578#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {49578#true} is VALID [2022-04-15 05:00:53,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {49578#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {49578#true} is VALID [2022-04-15 05:00:53,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {49578#true} [251] L78-->L78-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[] {49578#true} is VALID [2022-04-15 05:00:53,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {49578#true} [253] L78-2-->L82-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[] {49578#true} is VALID [2022-04-15 05:00:53,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {49578#true} [255] L82-1-->L86-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[] {49578#true} is VALID [2022-04-15 05:00:53,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {49578#true} [257] L86-1-->L90-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[] {49578#true} is VALID [2022-04-15 05:00:53,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {49578#true} [259] L90-1-->L94-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[] {49578#true} is VALID [2022-04-15 05:00:53,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {49578#true} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {49583#(not (= main_~p6~0 0))} [262] L98-1-->L102-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] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {49583#(not (= main_~p6~0 0))} [264] L102-1-->L106-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] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {49583#(not (= main_~p6~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {49583#(not (= main_~p6~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {49583#(not (= main_~p6~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {49583#(not (= main_~p6~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {49583#(not (= main_~p6~0 0))} [275] L122-1-->L128-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {49583#(not (= main_~p6~0 0))} [279] L128-1-->L133-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {49583#(not (= main_~p6~0 0))} [285] L133-1-->L138-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {49583#(not (= main_~p6~0 0))} [289] L138-1-->L143-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {49583#(not (= main_~p6~0 0))} [293] L143-1-->L148-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:53,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {49583#(not (= main_~p6~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {49579#false} is VALID [2022-04-15 05:00:53,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {49579#false} [300] L153-1-->L159: 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[] {49579#false} is VALID [2022-04-15 05:00:53,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {49579#false} [302] L159-->L184-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {49579#false} is VALID [2022-04-15 05:00:53,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {49579#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49579#false} is VALID [2022-04-15 05:00:53,310 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-15 05:00:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:53,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440709120] [2022-04-15 05:00:53,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440709120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:53,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:53,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295205555] [2022-04-15 05:00:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-15 05:00:53,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:53,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:53,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:53,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:53,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:53,324 INFO L87 Difference]: Start difference. First operand 2281 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:53,848 INFO L93 Difference]: Finished difference Result 3421 states and 5273 transitions. [2022-04-15 05:00:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-15 05:00:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-15 05:00:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-15 05:00:53,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-15 05:00:53,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:54,124 INFO L225 Difference]: With dead ends: 3421 [2022-04-15 05:00:54,124 INFO L226 Difference]: Without dead ends: 2315 [2022-04-15 05:00:54,126 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-15 05:00:54,126 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:54,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-15 05:00:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-15 05:00:54,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:54,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 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-15 05:00:54,161 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 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-15 05:00:54,162 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 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-15 05:00:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:54,293 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-15 05:00:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-15 05:00:54,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:54,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:54,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 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 2315 states. [2022-04-15 05:00:54,300 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 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 2315 states. [2022-04-15 05:00:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:54,429 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-15 05:00:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-15 05:00:54,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:54,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:54,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:54,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 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-15 05:00:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3527 transitions. [2022-04-15 05:00:54,575 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3527 transitions. Word has length 29 [2022-04-15 05:00:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:54,576 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 3527 transitions. [2022-04-15 05:00:54,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3527 transitions. [2022-04-15 05:00:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:00:54,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:54,577 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, 1, 1, 1] [2022-04-15 05:00:54,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 05:00:54,577 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash -701181757, now seen corresponding path program 1 times [2022-04-15 05:00:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:54,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957816816] [2022-04-15 05:00:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:54,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {60134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {60128#true} is VALID [2022-04-15 05:00:54,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {60128#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-15 05:00:54,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60128#true} {60128#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-15 05:00:54,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {60128#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:54,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {60134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {60128#true} is VALID [2022-04-15 05:00:54,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {60128#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-15 05:00:54,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60128#true} {60128#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-15 05:00:54,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {60128#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-15 05:00:54,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {60128#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {60128#true} is VALID [2022-04-15 05:00:54,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {60128#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {60128#true} is VALID [2022-04-15 05:00:54,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {60128#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {60128#true} is VALID [2022-04-15 05:00:54,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {60128#true} [251] L78-->L78-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[] {60128#true} is VALID [2022-04-15 05:00:54,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {60128#true} [253] L78-2-->L82-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[] {60128#true} is VALID [2022-04-15 05:00:54,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {60128#true} [255] L82-1-->L86-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[] {60128#true} is VALID [2022-04-15 05:00:54,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {60128#true} [257] L86-1-->L90-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[] {60128#true} is VALID [2022-04-15 05:00:54,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {60128#true} [259] L90-1-->L94-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[] {60128#true} is VALID [2022-04-15 05:00:54,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {60128#true} [261] L94-1-->L98-1: Formula: (= 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[] {60128#true} is VALID [2022-04-15 05:00:54,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {60128#true} [262] L98-1-->L102-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] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {60133#(= main_~lk7~0 1)} [264] L102-1-->L106-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] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {60133#(= main_~lk7~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {60133#(= main_~lk7~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {60133#(= main_~lk7~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {60133#(= main_~lk7~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {60133#(= main_~lk7~0 1)} [275] L122-1-->L128-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {60133#(= main_~lk7~0 1)} [279] L128-1-->L133-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {60133#(= main_~lk7~0 1)} [285] L133-1-->L138-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {60133#(= main_~lk7~0 1)} [289] L138-1-->L143-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {60133#(= main_~lk7~0 1)} [293] L143-1-->L148-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {60133#(= main_~lk7~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {60133#(= main_~lk7~0 1)} [300] L153-1-->L159: 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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:54,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {60133#(= main_~lk7~0 1)} [302] L159-->L184-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {60129#false} is VALID [2022-04-15 05:00:54,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {60129#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60129#false} is VALID [2022-04-15 05:00:54,639 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-15 05:00:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:54,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957816816] [2022-04-15 05:00:54,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957816816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:54,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:54,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:54,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479951345] [2022-04-15 05:00:54,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:54,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-15 05:00:54,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:54,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:54,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:54,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:54,657 INFO L87 Difference]: Start difference. First operand 2313 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:55,297 INFO L93 Difference]: Finished difference Result 4109 states and 6409 transitions. [2022-04-15 05:00:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-15 05:00:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-15 05:00:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-15 05:00:55,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-15 05:00:55,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:55,894 INFO L225 Difference]: With dead ends: 4109 [2022-04-15 05:00:55,894 INFO L226 Difference]: Without dead ends: 4107 [2022-04-15 05:00:55,896 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-15 05:00:55,896 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:55,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-15 05:00:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-15 05:00:55,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:55,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 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-15 05:00:55,944 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 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-15 05:00:55,946 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 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-15 05:00:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:56,388 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-15 05:00:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-15 05:00:56,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:56,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:56,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 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 4107 states. [2022-04-15 05:00:56,399 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 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 4107 states. [2022-04-15 05:00:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:56,834 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-15 05:00:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-15 05:00:56,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:56,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:56,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:56,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 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-15 05:00:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4935 transitions. [2022-04-15 05:00:57,169 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4935 transitions. Word has length 29 [2022-04-15 05:00:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:57,169 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 4935 transitions. [2022-04-15 05:00:57,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4935 transitions. [2022-04-15 05:00:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:00:57,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:57,173 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, 1, 1, 1] [2022-04-15 05:00:57,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 05:00:57,173 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash 806370052, now seen corresponding path program 1 times [2022-04-15 05:00:57,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:57,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804230556] [2022-04-15 05:00:57,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:57,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:57,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {76012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {76006#true} is VALID [2022-04-15 05:00:57,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {76006#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-15 05:00:57,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76006#true} {76006#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-15 05:00:57,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {76006#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:57,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {76012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {76006#true} is VALID [2022-04-15 05:00:57,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {76006#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76006#true} {76006#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {76006#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {76006#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {76006#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {76006#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {76006#true} [251] L78-->L78-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[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {76006#true} [253] L78-2-->L82-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[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {76006#true} [255] L82-1-->L86-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[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {76006#true} [257] L86-1-->L90-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[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {76006#true} [259] L90-1-->L94-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[] {76006#true} is VALID [2022-04-15 05:00:57,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {76006#true} [261] L94-1-->L98-1: Formula: (= 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[] {76006#true} is VALID [2022-04-15 05:00:57,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {76006#true} [263] L98-1-->L102-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {76011#(= main_~p7~0 0)} [264] L102-1-->L106-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] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {76011#(= main_~p7~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {76011#(= main_~p7~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {76011#(= main_~p7~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {76011#(= main_~p7~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {76011#(= main_~p7~0 0)} [275] L122-1-->L128-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {76011#(= main_~p7~0 0)} [279] L128-1-->L133-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {76011#(= main_~p7~0 0)} [285] L133-1-->L138-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {76011#(= main_~p7~0 0)} [289] L138-1-->L143-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {76011#(= main_~p7~0 0)} [293] L143-1-->L148-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {76011#(= main_~p7~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {76011#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:57,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {76011#(= main_~p7~0 0)} [300] L153-1-->L159: 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[] {76007#false} is VALID [2022-04-15 05:00:57,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {76007#false} [302] L159-->L184-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {76007#false} is VALID [2022-04-15 05:00:57,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {76007#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76007#false} is VALID [2022-04-15 05:00:57,214 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-15 05:00:57,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:57,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804230556] [2022-04-15 05:00:57,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804230556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:57,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:57,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259813436] [2022-04-15 05:00:57,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:57,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-15 05:00:57,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:57,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:57,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:57,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:57,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:57,230 INFO L87 Difference]: Start difference. First operand 3337 states and 4935 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:59,210 INFO L93 Difference]: Finished difference Result 7757 states and 11529 transitions. [2022-04-15 05:00:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:59,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-15 05:00:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-15 05:00:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:00:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-15 05:00:59,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-15 05:00:59,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:59,966 INFO L225 Difference]: With dead ends: 7757 [2022-04-15 05:00:59,966 INFO L226 Difference]: Without dead ends: 4491 [2022-04-15 05:00:59,970 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-15 05:00:59,971 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:59,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-15 05:01:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-15 05:01:00,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:00,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 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-15 05:01:00,034 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 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-15 05:01:00,037 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 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-15 05:01:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:00,564 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-15 05:01:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-15 05:01:00,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:00,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:00,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 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 4491 states. [2022-04-15 05:01:00,576 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 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 4491 states. [2022-04-15 05:01:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:01,104 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-15 05:01:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-15 05:01:01,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:01,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:01,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:01,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 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-15 05:01:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6599 transitions. [2022-04-15 05:01:01,675 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6599 transitions. Word has length 29 [2022-04-15 05:01:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:01,676 INFO L478 AbstractCegarLoop]: Abstraction has 4489 states and 6599 transitions. [2022-04-15 05:01:01,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-15 05:01:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6599 transitions. [2022-04-15 05:01:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:01:01,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:01,678 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, 1, 1, 1, 1] [2022-04-15 05:01:01,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 05:01:01,679 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash -261765188, now seen corresponding path program 1 times [2022-04-15 05:01:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:01,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252516831] [2022-04-15 05:01:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:01,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:01,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {97586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {97580#true} is VALID [2022-04-15 05:01:01,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {97580#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-15 05:01:01,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97580#true} {97580#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-15 05:01:01,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {97580#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:01,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {97586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {97580#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97580#true} {97580#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {97580#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {97580#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {97580#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {97580#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {97580#true} [251] L78-->L78-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[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {97580#true} [253] L78-2-->L82-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[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {97580#true} [255] L82-1-->L86-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[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {97580#true} [257] L86-1-->L90-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[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {97580#true} [259] L90-1-->L94-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[] {97580#true} is VALID [2022-04-15 05:01:01,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {97580#true} [261] L94-1-->L98-1: Formula: (= 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[] {97580#true} is VALID [2022-04-15 05:01:01,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {97580#true} [262] L98-1-->L102-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] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {97585#(not (= main_~p7~0 0))} [264] L102-1-->L106-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] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {97585#(not (= main_~p7~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {97585#(not (= main_~p7~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {97585#(not (= main_~p7~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {97585#(not (= main_~p7~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {97585#(not (= main_~p7~0 0))} [275] L122-1-->L128-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {97585#(not (= main_~p7~0 0))} [279] L128-1-->L133-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {97585#(not (= main_~p7~0 0))} [285] L133-1-->L138-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {97585#(not (= main_~p7~0 0))} [289] L138-1-->L143-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {97585#(not (= main_~p7~0 0))} [293] L143-1-->L148-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {97585#(not (= main_~p7~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:01:01,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {97585#(not (= main_~p7~0 0))} [301] L153-1-->L158-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[] {97581#false} is VALID [2022-04-15 05:01:01,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {97581#false} [304] L158-1-->L164: 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[] {97581#false} is VALID [2022-04-15 05:01:01,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {97581#false} [306] L164-->L184-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[] {97581#false} is VALID [2022-04-15 05:01:01,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {97581#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97581#false} is VALID [2022-04-15 05:01:01,724 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-15 05:01:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:01,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252516831] [2022-04-15 05:01:01,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252516831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:01,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:01,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132067248] [2022-04-15 05:01:01,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:01,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-15 05:01:01,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:01,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:01,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:01,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:01,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:01,749 INFO L87 Difference]: Start difference. First operand 4489 states and 6599 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:03,294 INFO L93 Difference]: Finished difference Result 6733 states and 9865 transitions. [2022-04-15 05:01:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-15 05:01:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-15 05:01:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-15 05:01:03,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-15 05:01:03,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:04,085 INFO L225 Difference]: With dead ends: 6733 [2022-04-15 05:01:04,086 INFO L226 Difference]: Without dead ends: 4555 [2022-04-15 05:01:04,088 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-15 05:01:04,089 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:01:04,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:01:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-15 05:01:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-15 05:01:04,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:04,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 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-15 05:01:04,160 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 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-15 05:01:04,162 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 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-15 05:01:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:04,711 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-15 05:01:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-15 05:01:04,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:04,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:04,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 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 4555 states. [2022-04-15 05:01:04,722 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 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 4555 states. [2022-04-15 05:01:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:05,321 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-15 05:01:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-15 05:01:05,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:05,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:05,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:05,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 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-15 05:01:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6599 transitions. [2022-04-15 05:01:05,993 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6599 transitions. Word has length 30 [2022-04-15 05:01:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:05,993 INFO L478 AbstractCegarLoop]: Abstraction has 4553 states and 6599 transitions. [2022-04-15 05:01:05,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6599 transitions. [2022-04-15 05:01:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:01:05,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:05,995 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, 1, 1, 1, 1] [2022-04-15 05:01:05,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 05:01:05,995 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash -772299365, now seen corresponding path program 1 times [2022-04-15 05:01:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:05,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9979954] [2022-04-15 05:01:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:06,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {118328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {118322#true} is VALID [2022-04-15 05:01:06,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {118322#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-15 05:01:06,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118322#true} {118322#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {118322#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {118328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {118322#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118322#true} {118322#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {118322#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {118322#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {118322#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {118322#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {118322#true} [251] L78-->L78-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[] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {118322#true} [253] L78-2-->L82-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[] {118322#true} is VALID [2022-04-15 05:01:06,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {118322#true} [255] L82-1-->L86-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[] {118322#true} is VALID [2022-04-15 05:01:06,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {118322#true} [257] L86-1-->L90-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[] {118322#true} is VALID [2022-04-15 05:01:06,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {118322#true} [259] L90-1-->L94-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[] {118322#true} is VALID [2022-04-15 05:01:06,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {118322#true} [261] L94-1-->L98-1: Formula: (= 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[] {118322#true} is VALID [2022-04-15 05:01:06,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {118322#true} [263] L98-1-->L102-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[] {118322#true} is VALID [2022-04-15 05:01:06,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {118322#true} [264] L102-1-->L106-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] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {118327#(= main_~lk8~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {118327#(= main_~lk8~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {118327#(= main_~lk8~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {118327#(= main_~lk8~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {118327#(= main_~lk8~0 1)} [275] L122-1-->L128-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {118327#(= main_~lk8~0 1)} [279] L128-1-->L133-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {118327#(= main_~lk8~0 1)} [285] L133-1-->L138-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {118327#(= main_~lk8~0 1)} [289] L138-1-->L143-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {118327#(= main_~lk8~0 1)} [293] L143-1-->L148-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {118327#(= main_~lk8~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {118327#(= main_~lk8~0 1)} [301] L153-1-->L158-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {118327#(= main_~lk8~0 1)} [304] L158-1-->L164: 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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-15 05:01:06,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {118327#(= main_~lk8~0 1)} [306] L164-->L184-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[] {118323#false} is VALID [2022-04-15 05:01:06,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {118323#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118323#false} is VALID [2022-04-15 05:01:06,034 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-15 05:01:06,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:06,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9979954] [2022-04-15 05:01:06,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9979954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:06,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:06,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468443625] [2022-04-15 05:01:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:06,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-15 05:01:06,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:06,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:06,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:06,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:06,051 INFO L87 Difference]: Start difference. First operand 4553 states and 6599 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:07,950 INFO L93 Difference]: Finished difference Result 7949 states and 11785 transitions. [2022-04-15 05:01:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:07,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-15 05:01:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 05:01:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 05:01:07,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-15 05:01:08,039 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-15 05:01:10,143 INFO L225 Difference]: With dead ends: 7949 [2022-04-15 05:01:10,144 INFO L226 Difference]: Without dead ends: 7947 [2022-04-15 05:01:10,145 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-15 05:01:10,145 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:01:10,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:01:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-15 05:01:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-15 05:01:10,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:10,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 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-15 05:01:10,246 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 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-15 05:01:10,249 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 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-15 05:01:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:11,985 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-15 05:01:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-15 05:01:11,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:11,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:11,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 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 7947 states. [2022-04-15 05:01:12,000 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 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 7947 states. [2022-04-15 05:01:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:13,852 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-15 05:01:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-15 05:01:13,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:13,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:13,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:13,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 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-15 05:01:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9351 transitions. [2022-04-15 05:01:15,220 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9351 transitions. Word has length 30 [2022-04-15 05:01:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:15,220 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 9351 transitions. [2022-04-15 05:01:15,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9351 transitions. [2022-04-15 05:01:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:01:15,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:15,223 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, 1, 1, 1, 1] [2022-04-15 05:01:15,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 05:01:15,224 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 735252444, now seen corresponding path program 1 times [2022-04-15 05:01:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:15,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718596969] [2022-04-15 05:01:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:15,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {149246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {149240#true} is VALID [2022-04-15 05:01:15,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {149240#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-15 05:01:15,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149240#true} {149240#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {149240#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:15,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {149246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {149240#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149240#true} {149240#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {149240#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {149240#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {149240#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {149240#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {149240#true} [251] L78-->L78-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[] {149240#true} is VALID [2022-04-15 05:01:15,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {149240#true} [253] L78-2-->L82-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[] {149240#true} is VALID [2022-04-15 05:01:15,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {149240#true} [255] L82-1-->L86-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[] {149240#true} is VALID [2022-04-15 05:01:15,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {149240#true} [257] L86-1-->L90-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[] {149240#true} is VALID [2022-04-15 05:01:15,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {149240#true} [259] L90-1-->L94-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[] {149240#true} is VALID [2022-04-15 05:01:15,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {149240#true} [261] L94-1-->L98-1: Formula: (= 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[] {149240#true} is VALID [2022-04-15 05:01:15,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {149240#true} [263] L98-1-->L102-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[] {149240#true} is VALID [2022-04-15 05:01:15,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {149240#true} [265] L102-1-->L106-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {149245#(= main_~p8~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {149245#(= main_~p8~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {149245#(= main_~p8~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {149245#(= main_~p8~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {149245#(= main_~p8~0 0)} [275] L122-1-->L128-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {149245#(= main_~p8~0 0)} [279] L128-1-->L133-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {149245#(= main_~p8~0 0)} [285] L133-1-->L138-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {149245#(= main_~p8~0 0)} [289] L138-1-->L143-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {149245#(= main_~p8~0 0)} [293] L143-1-->L148-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {149245#(= main_~p8~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {149245#(= main_~p8~0 0)} [301] L153-1-->L158-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:15,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {149245#(= main_~p8~0 0)} [304] L158-1-->L164: 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[] {149241#false} is VALID [2022-04-15 05:01:15,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {149241#false} [306] L164-->L184-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[] {149241#false} is VALID [2022-04-15 05:01:15,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {149241#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149241#false} is VALID [2022-04-15 05:01:15,266 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-15 05:01:15,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:15,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718596969] [2022-04-15 05:01:15,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718596969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:15,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:15,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973914613] [2022-04-15 05:01:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-15 05:01:15,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:15,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:15,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:15,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:15,283 INFO L87 Difference]: Start difference. First operand 6665 states and 9351 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:21,966 INFO L93 Difference]: Finished difference Result 15373 states and 21641 transitions. [2022-04-15 05:01:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:21,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-15 05:01:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-15 05:01:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-15 05:01:21,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-04-15 05:01:22,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:24,783 INFO L225 Difference]: With dead ends: 15373 [2022-04-15 05:01:24,783 INFO L226 Difference]: Without dead ends: 8843 [2022-04-15 05:01:24,789 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-15 05:01:24,790 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:01:24,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:01:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-15 05:01:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-15 05:01:24,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:24,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 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-15 05:01:24,972 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 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-15 05:01:24,979 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 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-15 05:01:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:27,214 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-15 05:01:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-15 05:01:27,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:27,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:27,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 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 8843 states. [2022-04-15 05:01:27,235 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 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 8843 states. [2022-04-15 05:01:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:29,614 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-15 05:01:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-15 05:01:29,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:29,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:29,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:29,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 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-15 05:01:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12295 transitions. [2022-04-15 05:01:32,099 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12295 transitions. Word has length 30 [2022-04-15 05:01:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:32,099 INFO L478 AbstractCegarLoop]: Abstraction has 8841 states and 12295 transitions. [2022-04-15 05:01:32,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-15 05:01:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12295 transitions. [2022-04-15 05:01:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 05:01:32,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:32,103 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, 1, 1, 1, 1, 1] [2022-04-15 05:01:32,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 05:01:32,104 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1828556384, now seen corresponding path program 1 times [2022-04-15 05:01:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:32,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767573395] [2022-04-15 05:01:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:32,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {191812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {191806#true} is VALID [2022-04-15 05:01:32,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {191806#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-15 05:01:32,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191806#true} {191806#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {191806#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {191812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {191806#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191806#true} {191806#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {191806#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {191806#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {191806#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {191806#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {191806#true} [251] L78-->L78-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[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {191806#true} [253] L78-2-->L82-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[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {191806#true} [255] L82-1-->L86-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[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {191806#true} [257] L86-1-->L90-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[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {191806#true} [259] L90-1-->L94-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[] {191806#true} is VALID [2022-04-15 05:01:32,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {191806#true} [261] L94-1-->L98-1: Formula: (= 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[] {191806#true} is VALID [2022-04-15 05:01:32,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {191806#true} [263] L98-1-->L102-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[] {191806#true} is VALID [2022-04-15 05:01:32,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {191806#true} [264] L102-1-->L106-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] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {191811#(not (= main_~p8~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {191811#(not (= main_~p8~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {191811#(not (= main_~p8~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {191811#(not (= main_~p8~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {191811#(not (= main_~p8~0 0))} [275] L122-1-->L128-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {191811#(not (= main_~p8~0 0))} [279] L128-1-->L133-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {191811#(not (= main_~p8~0 0))} [285] L133-1-->L138-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {191811#(not (= main_~p8~0 0))} [289] L138-1-->L143-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {191811#(not (= main_~p8~0 0))} [293] L143-1-->L148-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {191811#(not (= main_~p8~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {191811#(not (= main_~p8~0 0))} [301] L153-1-->L158-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:32,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {191811#(not (= main_~p8~0 0))} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {191807#false} is VALID [2022-04-15 05:01:32,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {191807#false} [308] L163-1-->L169: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {191807#false} is VALID [2022-04-15 05:01:32,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {191807#false} [310] L169-->L184-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {191807#false} is VALID [2022-04-15 05:01:32,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {191807#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191807#false} is VALID [2022-04-15 05:01:32,145 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-15 05:01:32,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:32,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767573395] [2022-04-15 05:01:32,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767573395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:32,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:32,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996234950] [2022-04-15 05:01:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:32,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-15 05:01:32,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:32,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:32,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:32,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:32,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:32,166 INFO L87 Difference]: Start difference. First operand 8841 states and 12295 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:37,615 INFO L93 Difference]: Finished difference Result 13261 states and 18377 transitions. [2022-04-15 05:01:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-15 05:01:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-15 05:01:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-15 05:01:37,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-15 05:01:37,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:40,534 INFO L225 Difference]: With dead ends: 13261 [2022-04-15 05:01:40,535 INFO L226 Difference]: Without dead ends: 8971 [2022-04-15 05:01:40,538 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-15 05:01:40,538 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:01:40,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:01:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-15 05:01:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-15 05:01:40,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:40,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 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-15 05:01:40,675 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 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-15 05:01:40,681 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 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-15 05:01:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:42,908 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-15 05:01:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-15 05:01:42,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:42,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:42,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 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 8971 states. [2022-04-15 05:01:42,929 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 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 8971 states. [2022-04-15 05:01:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:45,205 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-15 05:01:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-15 05:01:45,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:45,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:45,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:45,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 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-15 05:01:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12295 transitions. [2022-04-15 05:01:47,468 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12295 transitions. Word has length 31 [2022-04-15 05:01:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:47,468 INFO L478 AbstractCegarLoop]: Abstraction has 8969 states and 12295 transitions. [2022-04-15 05:01:47,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12295 transitions. [2022-04-15 05:01:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 05:01:47,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:47,471 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, 1, 1, 1, 1, 1] [2022-04-15 05:01:47,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 05:01:47,471 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1318022207, now seen corresponding path program 1 times [2022-04-15 05:01:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:47,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671927588] [2022-04-15 05:01:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:47,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {232650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {232644#true} is VALID [2022-04-15 05:01:47,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {232644#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-15 05:01:47,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232644#true} {232644#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-15 05:01:47,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {232644#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:47,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {232650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {232644#true} is VALID [2022-04-15 05:01:47,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {232644#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-15 05:01:47,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232644#true} {232644#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-15 05:01:47,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {232644#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-15 05:01:47,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {232644#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {232644#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {232644#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {232644#true} [251] L78-->L78-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[] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {232644#true} [253] L78-2-->L82-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[] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {232644#true} [255] L82-1-->L86-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[] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {232644#true} [257] L86-1-->L90-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[] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {232644#true} [259] L90-1-->L94-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[] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {232644#true} [261] L94-1-->L98-1: Formula: (= 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[] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {232644#true} [263] L98-1-->L102-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[] {232644#true} is VALID [2022-04-15 05:01:47,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {232644#true} [265] L102-1-->L106-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[] {232644#true} is VALID [2022-04-15 05:01:47,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {232644#true} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {232649#(= main_~lk9~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {232649#(= main_~lk9~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {232649#(= main_~lk9~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {232649#(= main_~lk9~0 1)} [275] L122-1-->L128-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {232649#(= main_~lk9~0 1)} [279] L128-1-->L133-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {232649#(= main_~lk9~0 1)} [285] L133-1-->L138-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {232649#(= main_~lk9~0 1)} [289] L138-1-->L143-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {232649#(= main_~lk9~0 1)} [293] L143-1-->L148-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {232649#(= main_~lk9~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {232649#(= main_~lk9~0 1)} [301] L153-1-->L158-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {232649#(= main_~lk9~0 1)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {232649#(= main_~lk9~0 1)} [308] L163-1-->L169: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:47,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {232649#(= main_~lk9~0 1)} [310] L169-->L184-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {232645#false} is VALID [2022-04-15 05:01:47,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {232645#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232645#false} is VALID [2022-04-15 05:01:47,511 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-15 05:01:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:47,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671927588] [2022-04-15 05:01:47,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671927588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:47,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:47,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666863357] [2022-04-15 05:01:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-15 05:01:47,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:47,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:47,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:47,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:47,528 INFO L87 Difference]: Start difference. First operand 8969 states and 12295 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:55,774 INFO L93 Difference]: Finished difference Result 15373 states and 21513 transitions. [2022-04-15 05:01:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-15 05:01:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 05:01:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:01:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 05:01:55,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-15 05:01:55,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:02,905 INFO L225 Difference]: With dead ends: 15373 [2022-04-15 05:02:02,905 INFO L226 Difference]: Without dead ends: 15371 [2022-04-15 05:02:02,907 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-15 05:02:02,907 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:02,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-15 05:02:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-15 05:02:03,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:03,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 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-15 05:02:03,078 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 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-15 05:02:03,088 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 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-15 05:02:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:09,575 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-15 05:02:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-15 05:02:09,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:09,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:09,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 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 15371 states. [2022-04-15 05:02:09,602 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 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 15371 states. [2022-04-15 05:02:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:16,114 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-15 05:02:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-15 05:02:16,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:16,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:16,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:16,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 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-15 05:02:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 17671 transitions. [2022-04-15 05:02:20,797 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 17671 transitions. Word has length 31 [2022-04-15 05:02:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:20,797 INFO L478 AbstractCegarLoop]: Abstraction has 13321 states and 17671 transitions. [2022-04-15 05:02:20,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:02:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 17671 transitions. [2022-04-15 05:02:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 05:02:20,802 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:20,802 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, 1, 1, 1, 1, 1] [2022-04-15 05:02:20,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 05:02:20,803 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1469393280, now seen corresponding path program 1 times [2022-04-15 05:02:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:20,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121239296] [2022-04-15 05:02:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:20,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:20,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {292880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {292874#true} is VALID [2022-04-15 05:02:20,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {292874#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-15 05:02:20,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292874#true} {292874#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-15 05:02:20,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {292874#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:20,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {292880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {292874#true} is VALID [2022-04-15 05:02:20,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {292874#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-15 05:02:20,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292874#true} {292874#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-15 05:02:20,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {292874#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {292874#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {292874#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {292874#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {292874#true} [251] L78-->L78-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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {292874#true} [253] L78-2-->L82-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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {292874#true} [255] L82-1-->L86-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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {292874#true} [257] L86-1-->L90-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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {292874#true} [259] L90-1-->L94-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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {292874#true} [261] L94-1-->L98-1: Formula: (= 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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {292874#true} [263] L98-1-->L102-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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {292874#true} [265] L102-1-->L106-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[] {292874#true} is VALID [2022-04-15 05:02:20,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {292874#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {292879#(= main_~p9~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {292879#(= main_~p9~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {292879#(= main_~p9~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {292879#(= main_~p9~0 0)} [275] L122-1-->L128-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {292879#(= main_~p9~0 0)} [279] L128-1-->L133-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {292879#(= main_~p9~0 0)} [285] L133-1-->L138-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {292879#(= main_~p9~0 0)} [289] L138-1-->L143-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {292879#(= main_~p9~0 0)} [293] L143-1-->L148-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {292879#(= main_~p9~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {292879#(= main_~p9~0 0)} [301] L153-1-->L158-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {292879#(= main_~p9~0 0)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {292879#(= main_~p9~0 0)} is VALID [2022-04-15 05:02:20,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {292879#(= main_~p9~0 0)} [308] L163-1-->L169: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {292875#false} is VALID [2022-04-15 05:02:20,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {292875#false} [310] L169-->L184-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {292875#false} is VALID [2022-04-15 05:02:20,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {292875#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292875#false} is VALID [2022-04-15 05:02:20,839 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-15 05:02:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:20,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121239296] [2022-04-15 05:02:20,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121239296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:20,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:20,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369302879] [2022-04-15 05:02:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-15 05:02:20,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:20,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:02:20,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:20,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:20,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:20,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:20,858 INFO L87 Difference]: Start difference. First operand 13321 states and 17671 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:02:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:47,856 INFO L93 Difference]: Finished difference Result 30477 states and 40457 transitions. [2022-04-15 05:02:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-15 05:02:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:02:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-15 05:02:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:02:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-15 05:02:47,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-15 05:02:47,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:56,945 INFO L225 Difference]: With dead ends: 30477 [2022-04-15 05:02:56,945 INFO L226 Difference]: Without dead ends: 17419 [2022-04-15 05:02:56,953 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-15 05:02:56,954 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:56,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-15 05:02:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-15 05:02:57,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:57,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 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-15 05:02:57,203 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 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-15 05:02:57,221 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 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-15 05:03:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:05,550 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-15 05:03:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-15 05:03:05,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:03:05,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:03:05,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 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 17419 states. [2022-04-15 05:03:05,591 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 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 17419 states. [2022-04-15 05:03:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:13,276 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-15 05:03:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-15 05:03:13,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:03:13,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:03:13,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:03:13,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:03:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 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-15 05:03:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 22791 transitions. [2022-04-15 05:03:21,467 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 22791 transitions. Word has length 31 [2022-04-15 05:03:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:03:21,467 INFO L478 AbstractCegarLoop]: Abstraction has 17417 states and 22791 transitions. [2022-04-15 05:03:21,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-15 05:03:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 22791 transitions. [2022-04-15 05:03:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:03:21,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:03:21,474 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, 1, 1, 1, 1, 1, 1] [2022-04-15 05:03:21,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 05:03:21,474 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:03:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:03:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2090951496, now seen corresponding path program 1 times [2022-04-15 05:03:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:03:21,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370444972] [2022-04-15 05:03:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:03:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:03:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:03:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:03:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:03:21,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {376918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {376912#true} is VALID [2022-04-15 05:03:21,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {376912#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-15 05:03:21,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {376912#true} {376912#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-15 05:03:21,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {376912#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:03:21,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {376918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {376912#true} is VALID [2022-04-15 05:03:21,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {376912#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-15 05:03:21,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376912#true} {376912#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {376912#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {376912#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {376912#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {376912#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {376912#true} [251] L78-->L78-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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {376912#true} [253] L78-2-->L82-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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {376912#true} [255] L82-1-->L86-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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {376912#true} [257] L86-1-->L90-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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {376912#true} [259] L90-1-->L94-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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {376912#true} [261] L94-1-->L98-1: Formula: (= 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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {376912#true} [263] L98-1-->L102-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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {376912#true} [265] L102-1-->L106-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[] {376912#true} is VALID [2022-04-15 05:03:21,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {376912#true} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {376917#(not (= main_~p9~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {376917#(not (= main_~p9~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {376917#(not (= main_~p9~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {376917#(not (= main_~p9~0 0))} [275] L122-1-->L128-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {376917#(not (= main_~p9~0 0))} [279] L128-1-->L133-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {376917#(not (= main_~p9~0 0))} [285] L133-1-->L138-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {376917#(not (= main_~p9~0 0))} [289] L138-1-->L143-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {376917#(not (= main_~p9~0 0))} [293] L143-1-->L148-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {376917#(not (= main_~p9~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {376917#(not (= main_~p9~0 0))} [301] L153-1-->L158-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {376917#(not (= main_~p9~0 0))} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:03:21,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {376917#(not (= main_~p9~0 0))} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {376913#false} is VALID [2022-04-15 05:03:21,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {376913#false} [312] L168-1-->L174: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {376913#false} is VALID [2022-04-15 05:03:21,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {376913#false} [314] L174-->L184-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {376913#false} is VALID [2022-04-15 05:03:21,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {376913#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376913#false} is VALID [2022-04-15 05:03:21,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-15 05:03:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:03:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370444972] [2022-04-15 05:03:21,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370444972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:03:21,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:03:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:03:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62886707] [2022-04-15 05:03:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:03:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-15 05:03:21,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:03:21,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:03:21,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:03:21,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:03:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:03:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:03:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:03:21,531 INFO L87 Difference]: Start difference. First operand 17417 states and 22791 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:03:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:41,246 INFO L93 Difference]: Finished difference Result 26125 states and 34057 transitions. [2022-04-15 05:03:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:03:41,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-15 05:03:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:03:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:03:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 05:03:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:03:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 05:03:41,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-15 05:03:41,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:03:50,438 INFO L225 Difference]: With dead ends: 26125 [2022-04-15 05:03:50,438 INFO L226 Difference]: Without dead ends: 17675 [2022-04-15 05:03:50,444 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-15 05:03:50,444 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:03:50,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:03:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-15 05:03:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-15 05:03:50,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:03:50,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 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-15 05:03:50,682 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 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-15 05:03:50,702 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 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-15 05:04:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:04:00,539 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-15 05:04:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-15 05:04:00,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:04:00,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:04:00,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 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 17675 states. [2022-04-15 05:04:00,592 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 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 17675 states. [2022-04-15 05:04:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:04:09,042 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-15 05:04:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-15 05:04:09,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:04:09,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:04:09,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:04:09,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:04:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 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-15 05:04:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 22791 transitions. [2022-04-15 05:04:17,156 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 22791 transitions. Word has length 32 [2022-04-15 05:04:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:04:17,168 INFO L478 AbstractCegarLoop]: Abstraction has 17673 states and 22791 transitions. [2022-04-15 05:04:17,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:04:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 22791 transitions. [2022-04-15 05:04:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:04:17,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:04:17,175 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, 1, 1, 1, 1, 1, 1] [2022-04-15 05:04:17,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 05:04:17,176 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:04:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:04:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1693481623, now seen corresponding path program 1 times [2022-04-15 05:04:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:04:17,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779581366] [2022-04-15 05:04:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:04:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:04:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:04:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:04:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:04:17,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {457372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {457366#true} is VALID [2022-04-15 05:04:17,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {457366#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-15 05:04:17,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457366#true} {457366#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-15 05:04:17,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {457366#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:04:17,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {457372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {457366#true} is VALID [2022-04-15 05:04:17,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {457366#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-15 05:04:17,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457366#true} {457366#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-15 05:04:17,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {457366#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {457366#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {457366#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {457366#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {457366#true} [251] L78-->L78-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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {457366#true} [253] L78-2-->L82-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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {457366#true} [255] L82-1-->L86-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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {457366#true} [257] L86-1-->L90-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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {457366#true} [259] L90-1-->L94-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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {457366#true} [261] L94-1-->L98-1: Formula: (= 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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {457366#true} [263] L98-1-->L102-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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {457366#true} [265] L102-1-->L106-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[] {457366#true} is VALID [2022-04-15 05:04:17,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {457366#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-15 05:04:17,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {457366#true} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {457371#(= main_~lk10~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {457371#(= main_~lk10~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {457371#(= main_~lk10~0 1)} [275] L122-1-->L128-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {457371#(= main_~lk10~0 1)} [279] L128-1-->L133-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {457371#(= main_~lk10~0 1)} [285] L133-1-->L138-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {457371#(= main_~lk10~0 1)} [289] L138-1-->L143-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {457371#(= main_~lk10~0 1)} [293] L143-1-->L148-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {457371#(= main_~lk10~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {457371#(= main_~lk10~0 1)} [301] L153-1-->L158-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {457371#(= main_~lk10~0 1)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {457371#(= main_~lk10~0 1)} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {457371#(= main_~lk10~0 1)} [312] L168-1-->L174: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-15 05:04:17,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {457371#(= main_~lk10~0 1)} [314] L174-->L184-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {457367#false} is VALID [2022-04-15 05:04:17,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {457367#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457367#false} is VALID [2022-04-15 05:04:17,233 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-15 05:04:17,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:04:17,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779581366] [2022-04-15 05:04:17,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779581366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:04:17,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:04:17,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:04:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244983433] [2022-04-15 05:04:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:04:17,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-15 05:04:17,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:04:17,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:04:17,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:04:17,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:04:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:04:17,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:04:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:04:17,255 INFO L87 Difference]: Start difference. First operand 17673 states and 22791 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:04:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:04:46,927 INFO L93 Difference]: Finished difference Result 29709 states and 38921 transitions. [2022-04-15 05:04:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:04:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-15 05:04:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:04:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:04:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 05:04:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:04:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 05:04:46,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-15 05:04:46,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:05:13,925 INFO L225 Difference]: With dead ends: 29709 [2022-04-15 05:05:13,925 INFO L226 Difference]: Without dead ends: 29707 [2022-04-15 05:05:13,929 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-15 05:05:13,929 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:05:13,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:05:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29707 states. [2022-04-15 05:05:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29707 to 26633. [2022-04-15 05:05:14,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:05:14,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 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-15 05:05:14,276 INFO L74 IsIncluded]: Start isIncluded. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 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-15 05:05:14,304 INFO L87 Difference]: Start difference. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 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-15 05:05:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:05:39,665 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-15 05:05:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-15 05:05:39,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:05:39,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:05:39,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 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 29707 states. [2022-04-15 05:05:39,775 INFO L87 Difference]: Start difference. First operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 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 29707 states. [2022-04-15 05:06:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:06:09,190 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-15 05:06:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-15 05:06:09,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:06:09,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:06:09,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:06:09,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:06:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 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-15 05:06:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26633 states to 26633 states and 33287 transitions. [2022-04-15 05:06:27,699 INFO L78 Accepts]: Start accepts. Automaton has 26633 states and 33287 transitions. Word has length 32 [2022-04-15 05:06:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:06:27,699 INFO L478 AbstractCegarLoop]: Abstraction has 26633 states and 33287 transitions. [2022-04-15 05:06:27,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:06:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26633 states and 33287 transitions. [2022-04-15 05:06:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:06:27,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:06:27,717 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, 1, 1, 1, 1, 1, 1] [2022-04-15 05:06:27,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 05:06:27,717 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:06:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:06:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1093933864, now seen corresponding path program 1 times [2022-04-15 05:06:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:06:27,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883111383] [2022-04-15 05:06:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:06:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:06:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:06:27,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:06:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:06:27,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {574690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {574684#true} is VALID [2022-04-15 05:06:27,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {574684#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-15 05:06:27,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574684#true} {574684#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-15 05:06:27,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {574684#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:06:27,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {574690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {574684#true} is VALID [2022-04-15 05:06:27,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {574684#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-15 05:06:27,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574684#true} {574684#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-15 05:06:27,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {574684#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {574684#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {574684#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {574684#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {574684#true} [251] L78-->L78-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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {574684#true} [253] L78-2-->L82-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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {574684#true} [255] L82-1-->L86-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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {574684#true} [257] L86-1-->L90-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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {574684#true} [259] L90-1-->L94-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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {574684#true} [261] L94-1-->L98-1: Formula: (= 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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {574684#true} [263] L98-1-->L102-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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {574684#true} [265] L102-1-->L106-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[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {574684#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-15 05:06:27,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {574684#true} [269] L110-1-->L114-1: Formula: (= v_main_~p10~0_5 0) InVars {main_~p10~0=v_main_~p10~0_5} OutVars{main_~p10~0=v_main_~p10~0_5} AuxVars[] AssignedVars[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {574689#(= main_~p10~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {574689#(= main_~p10~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {574689#(= main_~p10~0 0)} [275] L122-1-->L128-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {574689#(= main_~p10~0 0)} [279] L128-1-->L133-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {574689#(= main_~p10~0 0)} [285] L133-1-->L138-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {574689#(= main_~p10~0 0)} [289] L138-1-->L143-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {574689#(= main_~p10~0 0)} [293] L143-1-->L148-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {574689#(= main_~p10~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {574689#(= main_~p10~0 0)} [301] L153-1-->L158-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {574689#(= main_~p10~0 0)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {574689#(= main_~p10~0 0)} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {574689#(= main_~p10~0 0)} is VALID [2022-04-15 05:06:27,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {574689#(= main_~p10~0 0)} [312] L168-1-->L174: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {574685#false} is VALID [2022-04-15 05:06:27,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {574685#false} [314] L174-->L184-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {574685#false} is VALID [2022-04-15 05:06:27,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {574685#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574685#false} is VALID [2022-04-15 05:06:27,778 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-15 05:06:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:06:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883111383] [2022-04-15 05:06:27,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883111383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:06:27,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:06:27,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:06:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410800626] [2022-04-15 05:06:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:06:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-15 05:06:27,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:06:27,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:06:27,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:06:27,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:06:27,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:06:27,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:06:27,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:06:27,795 INFO L87 Difference]: Start difference. First operand 26633 states and 33287 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:09:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:09:56,332 INFO L93 Difference]: Finished difference Result 60429 states and 75273 transitions. [2022-04-15 05:09:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:09:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-15 05:09:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:09:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:09:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-15 05:09:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:09:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-15 05:09:56,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-15 05:09:56,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:10:31,065 INFO L225 Difference]: With dead ends: 60429 [2022-04-15 05:10:31,065 INFO L226 Difference]: Without dead ends: 34315 [2022-04-15 05:10:31,078 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-15 05:10:31,079 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:10:31,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:10:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34315 states. [2022-04-15 05:10:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34315 to 34313. [2022-04-15 05:10:31,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:10:31,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 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-15 05:10:31,695 INFO L74 IsIncluded]: Start isIncluded. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 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-15 05:10:31,731 INFO L87 Difference]: Start difference. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 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-15 05:11:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:11:31,304 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-15 05:11:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-15 05:11:31,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:11:31,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:11:31,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 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 34315 states. [2022-04-15 05:11:31,465 INFO L87 Difference]: Start difference. First operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 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 34315 states. [2022-04-15 05:12:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:12:19,580 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-15 05:12:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-15 05:12:19,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:12:19,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:12:19,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:12:19,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:12:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 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-15 05:13:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34313 states to 34313 states and 41991 transitions. [2022-04-15 05:13:00,941 INFO L78 Accepts]: Start accepts. Automaton has 34313 states and 41991 transitions. Word has length 32 [2022-04-15 05:13:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:13:00,941 INFO L478 AbstractCegarLoop]: Abstraction has 34313 states and 41991 transitions. [2022-04-15 05:13:00,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-15 05:13:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 34313 states and 41991 transitions. [2022-04-15 05:13:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 05:13:00,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:13:00,954 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:13:00,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 05:13:00,954 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:13:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:13:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash 958355932, now seen corresponding path program 1 times [2022-04-15 05:13:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:13:00,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387079654] [2022-04-15 05:13:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:13:00,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:13:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:13:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:13:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:13:01,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {740648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {740642#true} is VALID [2022-04-15 05:13:01,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {740642#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-15 05:13:01,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {740642#true} {740642#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-15 05:13:01,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {740642#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:13:01,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {740648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {740642#true} is VALID [2022-04-15 05:13:01,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {740642#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740642#true} {740642#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {740642#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {740642#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 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|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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~nondet14_2| v_main_~p11~0_1) (<= |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)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) 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~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, 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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {740642#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {740642#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {740642#true} [251] L78-->L78-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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {740642#true} [253] L78-2-->L82-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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {740642#true} [255] L82-1-->L86-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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {740642#true} [257] L86-1-->L90-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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {740642#true} [259] L90-1-->L94-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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {740642#true} [261] L94-1-->L98-1: Formula: (= 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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {740642#true} [263] L98-1-->L102-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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {740642#true} [265] L102-1-->L106-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[] {740642#true} is VALID [2022-04-15 05:13:01,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {740642#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-15 05:13:01,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {740642#true} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {740647#(not (= main_~p10~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {740647#(not (= main_~p10~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {740647#(not (= main_~p10~0 0))} [275] L122-1-->L128-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {740647#(not (= main_~p10~0 0))} [279] L128-1-->L133-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {740647#(not (= main_~p10~0 0))} [285] L133-1-->L138-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {740647#(not (= main_~p10~0 0))} [289] L138-1-->L143-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {740647#(not (= main_~p10~0 0))} [293] L143-1-->L148-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {740647#(not (= main_~p10~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {740647#(not (= main_~p10~0 0))} [301] L153-1-->L158-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {740647#(not (= main_~p10~0 0))} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {740647#(not (= main_~p10~0 0))} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-15 05:13:01,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {740647#(not (= main_~p10~0 0))} [313] L168-1-->L173-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-15 05:13:01,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {740643#false} [316] L173-1-->L179: Formula: (not (= v_main_~p11~0_2 0)) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-15 05:13:01,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {740643#false} [318] L179-->L184-1: Formula: (not (= v_main_~lk11~0_3 1)) InVars {main_~lk11~0=v_main_~lk11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_3} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-15 05:13:01,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {740643#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-15 05:13:01,024 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-15 05:13:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:13:01,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387079654] [2022-04-15 05:13:01,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387079654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:13:01,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:13:01,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:13:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812581321] [2022-04-15 05:13:01,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:13:01,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-15 05:13:01,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:13:01,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-15 05:13:01,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:13:01,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:13:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:13:01,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:13:01,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:13:01,046 INFO L87 Difference]: Start difference. First operand 34313 states and 41991 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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)