/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:20:48,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:20:48,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:20:48,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:20:48,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:20:48,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:20:48,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:20:48,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:20:48,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:20:48,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:20:48,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:20:48,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:20:48,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:20:48,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:20:48,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:20:48,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:20:48,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:20:48,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:20:48,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:20:48,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:20:48,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:20:48,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:20:48,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:20:48,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:20:48,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:20:48,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:20:48,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:20:48,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:20:48,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:20:48,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:20:48,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:20:48,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:20:48,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:20:48,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:20:48,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:20:48,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:20:48,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:20:48,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:20:48,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:20:48,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:20:48,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:20:48,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:20:48,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 21:20:48,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:20:48,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:20:48,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:20:48,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 21:20:48,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:20:48,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 21:20:48,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:20:48,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:20:48,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:20:48,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:20:48,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 21:20:48,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:20:48,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:20:48,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:20:48,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:20:48,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:20:48,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 21:20:48,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:20:48,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:48,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:20:48,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:20:48,907 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:20:48,907 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 21:20:49,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:20:49,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:20:49,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:20:49,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:20:49,110 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:20:49,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-04-07 21:20:49,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ca2987b/f3054f40dcd24f77b01e11ff97332ce3/FLAG566ae9942 [2022-04-07 21:20:49,530 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:20:49,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-04-07 21:20:49,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ca2987b/f3054f40dcd24f77b01e11ff97332ce3/FLAG566ae9942 [2022-04-07 21:20:49,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ca2987b/f3054f40dcd24f77b01e11ff97332ce3 [2022-04-07 21:20:49,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:20:49,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:20:49,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:49,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:20:49,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:20:49,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1467ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49, skipping insertion in model container [2022-04-07 21:20:49,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:20:49,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:20:49,688 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_7.c[2881,2894] [2022-04-07 21:20:49,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:49,695 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:20:49,710 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_7.c[2881,2894] [2022-04-07 21:20:49,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:49,719 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:20:49,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49 WrapperNode [2022-04-07 21:20:49,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:49,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:20:49,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:20:49,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:20:49,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:20:49,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:20:49,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:20:49,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:20:49,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (1/1) ... [2022-04-07 21:20:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:49,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:20:49,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 21:20:49,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 21:20:49,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:20:49,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:20:49,795 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:20:49,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:20:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:20:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:20:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:20:49,839 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:20:49,840 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:20:50,039 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:20:50,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:20:50,044 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:20:50,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:50 BoogieIcfgContainer [2022-04-07 21:20:50,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:20:50,046 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:20:50,046 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:20:50,047 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:20:50,049 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:50" (1/1) ... [2022-04-07 21:20:50,050 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 21:20:50,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:50 BasicIcfg [2022-04-07 21:20:50,072 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:20:50,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:20:50,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:20:50,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:20:50,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:20:49" (1/4) ... [2022-04-07 21:20:50,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b734b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:50, skipping insertion in model container [2022-04-07 21:20:50,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:49" (2/4) ... [2022-04-07 21:20:50,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b734b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:50, skipping insertion in model container [2022-04-07 21:20:50,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:50" (3/4) ... [2022-04-07 21:20:50,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b734b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:50, skipping insertion in model container [2022-04-07 21:20:50,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:50" (4/4) ... [2022-04-07 21:20:50,077 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.cJordan [2022-04-07 21:20:50,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:20:50,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:20:50,104 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:20:50,108 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 21:20:50,108 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:20:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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-07 21:20:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 21:20:50,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:50,138 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:50,138 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -172104918, now seen corresponding path program 1 times [2022-04-07 21:20:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:50,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123522447] [2022-04-07 21:20:50,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:50,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39#true} is VALID [2022-04-07 21:20:50,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 21:20:50,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 21:20:50,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:50,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39#true} is VALID [2022-04-07 21:20:50,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 21:20:50,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 21:20:50,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-07 21:20:50,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {39#true} is VALID [2022-04-07 21:20:50,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {39#true} is VALID [2022-04-07 21:20:50,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {39#true} is VALID [2022-04-07 21:20:50,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} [165] L53-->L53-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] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} [167] L53-2-->L57-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] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} [169] L57-1-->L61-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] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} [177] L73-1-->L77-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] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} [179] L77-1-->L84: 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[] {44#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:50,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} [181] L84-->L114-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[] {40#false} is VALID [2022-04-07 21:20:50,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-07 21:20:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:50,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123522447] [2022-04-07 21:20:50,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123522447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:50,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:50,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747217778] [2022-04-07 21:20:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:50,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-04-07 21:20:50,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:50,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:50,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:50,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:50,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:50,447 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:50,669 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2022-04-07 21:20:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:50,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-04-07 21:20:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-07 21:20:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-07 21:20:50,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-07 21:20:50,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:50,792 INFO L225 Difference]: With dead ends: 63 [2022-04-07 21:20:50,792 INFO L226 Difference]: Without dead ends: 55 [2022-04-07 21:20:50,793 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-07 21:20:50,796 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:50,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:20:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-07 21:20:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-04-07 21:20:50,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:50,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,815 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,816 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:50,819 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-07 21:20:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-07 21:20:50,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:50,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:50,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 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 55 states. [2022-04-07 21:20:50,831 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 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 55 states. [2022-04-07 21:20:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:50,834 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-07 21:20:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-07 21:20:50,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:50,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:50,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:50,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-04-07 21:20:50,838 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-04-07 21:20:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:50,838 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-04-07 21:20:50,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-04-07 21:20:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 21:20:50,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:50,839 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:50,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:20:50,839 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash -368618423, now seen corresponding path program 1 times [2022-04-07 21:20:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:50,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090721146] [2022-04-07 21:20:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:50,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {263#true} is VALID [2022-04-07 21:20:50,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-07 21:20:50,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {263#true} {263#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-07 21:20:50,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {263#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:50,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {263#true} is VALID [2022-04-07 21:20:50,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {263#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-07 21:20:50,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-07 21:20:50,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {263#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-07 21:20:50,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {263#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {263#true} is VALID [2022-04-07 21:20:50,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {263#true} is VALID [2022-04-07 21:20:50,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {263#true} is VALID [2022-04-07 21:20:50,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#true} [166] L53-->L53-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[] {268#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:50,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(= main_~p1~0 0)} [167] L53-2-->L57-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] {268#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:50,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {268#(= main_~p1~0 0)} [169] L57-1-->L61-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] {268#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:50,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(= main_~p1~0 0)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {268#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:50,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {268#(= main_~p1~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {268#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:50,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {268#(= main_~p1~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {268#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:50,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(= main_~p1~0 0)} [177] L73-1-->L77-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] {268#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:50,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {268#(= main_~p1~0 0)} [179] L77-1-->L84: 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[] {264#false} is VALID [2022-04-07 21:20:50,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#false} [181] L84-->L114-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[] {264#false} is VALID [2022-04-07 21:20:50,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#false} is VALID [2022-04-07 21:20:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:50,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090721146] [2022-04-07 21:20:50,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090721146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:50,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:50,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257802982] [2022-04-07 21:20:50,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-04-07 21:20:50,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:50,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:50,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:50,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:50,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:50,909 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,017 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-07 21:20:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-04-07 21:20:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-07 21:20:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-07 21:20:51,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-07 21:20:51,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:51,129 INFO L225 Difference]: With dead ends: 55 [2022-04-07 21:20:51,129 INFO L226 Difference]: Without dead ends: 55 [2022-04-07 21:20:51,129 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-07 21:20:51,130 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:51,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-07 21:20:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-07 21:20:51,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:51,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,152 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,152 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,158 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-07 21:20:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-07 21:20:51,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:51,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:51,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 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 55 states. [2022-04-07 21:20:51,165 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 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 55 states. [2022-04-07 21:20:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,170 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-07 21:20:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-07 21:20:51,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:51,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:51,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:51,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-04-07 21:20:51,176 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-04-07 21:20:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:51,177 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-04-07 21:20:51,177 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-04-07 21:20:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 21:20:51,177 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:51,177 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:51,177 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:20:51,178 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1040253202, now seen corresponding path program 1 times [2022-04-07 21:20:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:51,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352509996] [2022-04-07 21:20:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:51,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {493#true} is VALID [2022-04-07 21:20:51,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#true} is VALID [2022-04-07 21:20:51,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {493#true} {493#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#true} is VALID [2022-04-07 21:20:51,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {493#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:51,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {493#true} is VALID [2022-04-07 21:20:51,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#true} is VALID [2022-04-07 21:20:51,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#true} is VALID [2022-04-07 21:20:51,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {493#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#true} is VALID [2022-04-07 21:20:51,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {493#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {493#true} is VALID [2022-04-07 21:20:51,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {493#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {493#true} is VALID [2022-04-07 21:20:51,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {493#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {493#true} is VALID [2022-04-07 21:20:51,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {493#true} [165] L53-->L53-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] {498#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:51,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {498#(not (= main_~p1~0 0))} [167] L53-2-->L57-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] {498#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:51,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(not (= main_~p1~0 0))} [169] L57-1-->L61-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] {498#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:51,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {498#(not (= main_~p1~0 0))} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {498#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:51,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {498#(not (= main_~p1~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {498#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:51,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#(not (= main_~p1~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {498#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:51,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#(not (= main_~p1~0 0))} [177] L73-1-->L77-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] {498#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:51,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#(not (= main_~p1~0 0))} [180] L77-1-->L83-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[] {494#false} is VALID [2022-04-07 21:20:51,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {494#false} [183] L83-1-->L89: 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[] {494#false} is VALID [2022-04-07 21:20:51,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {494#false} [187] L89-->L114-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[] {494#false} is VALID [2022-04-07 21:20:51,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {494#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {494#false} is VALID [2022-04-07 21:20:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:51,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352509996] [2022-04-07 21:20:51,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352509996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:51,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:51,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032102604] [2022-04-07 21:20:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 21:20:51,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:51,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:51,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:51,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:51,291 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,431 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-07 21:20:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:51,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 21:20:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-04-07 21:20:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-04-07 21:20:51,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2022-04-07 21:20:51,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:51,502 INFO L225 Difference]: With dead ends: 58 [2022-04-07 21:20:51,502 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 21:20:51,503 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-07 21:20:51,504 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:51,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 21:20:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-07 21:20:51,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:51,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,507 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,507 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,509 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-07 21:20:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-07 21:20:51,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:51,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:51,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 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 58 states. [2022-04-07 21:20:51,510 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 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 58 states. [2022-04-07 21:20:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,511 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-07 21:20:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-07 21:20:51,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:51,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:51,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:51,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-04-07 21:20:51,513 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-04-07 21:20:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:51,514 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-04-07 21:20:51,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-04-07 21:20:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 21:20:51,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:51,514 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:51,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:20:51,515 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1457762735, now seen corresponding path program 1 times [2022-04-07 21:20:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:51,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050493764] [2022-04-07 21:20:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:51,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:51,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {735#true} is VALID [2022-04-07 21:20:51,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-07 21:20:51,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {735#true} {735#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-07 21:20:51,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:51,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {735#true} is VALID [2022-04-07 21:20:51,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {735#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-07 21:20:51,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-07 21:20:51,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {735#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#true} is VALID [2022-04-07 21:20:51,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {735#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {735#true} is VALID [2022-04-07 21:20:51,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {735#true} is VALID [2022-04-07 21:20:51,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {735#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {735#true} is VALID [2022-04-07 21:20:51,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#true} [166] L53-->L53-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[] {735#true} is VALID [2022-04-07 21:20:51,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#true} [167] L53-2-->L57-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] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {740#(= main_~lk2~0 1)} [169] L57-1-->L61-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] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {740#(= main_~lk2~0 1)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {740#(= main_~lk2~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {740#(= main_~lk2~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {740#(= main_~lk2~0 1)} [177] L73-1-->L77-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] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {740#(= main_~lk2~0 1)} [180] L77-1-->L83-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[] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {740#(= main_~lk2~0 1)} [183] L83-1-->L89: 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[] {740#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:51,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {740#(= main_~lk2~0 1)} [187] L89-->L114-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[] {736#false} is VALID [2022-04-07 21:20:51,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {736#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {736#false} is VALID [2022-04-07 21:20:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:51,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050493764] [2022-04-07 21:20:51,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050493764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:51,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:51,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62123990] [2022-04-07 21:20:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 21:20:51,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:51,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:51,581 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:51,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:51,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:51,582 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,706 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2022-04-07 21:20:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 21:20:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-07 21:20:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-07 21:20:51,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2022-04-07 21:20:51,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:51,785 INFO L225 Difference]: With dead ends: 99 [2022-04-07 21:20:51,785 INFO L226 Difference]: Without dead ends: 99 [2022-04-07 21:20:51,785 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-07 21:20:51,786 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:51,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 59 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-07 21:20:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2022-04-07 21:20:51,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:51,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,790 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,791 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,793 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2022-04-07 21:20:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 166 transitions. [2022-04-07 21:20:51,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:51,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:51,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 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 99 states. [2022-04-07 21:20:51,808 INFO L87 Difference]: Start difference. First operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 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 99 states. [2022-04-07 21:20:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,810 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2022-04-07 21:20:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 166 transitions. [2022-04-07 21:20:51,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:51,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:51,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:51,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 121 transitions. [2022-04-07 21:20:51,813 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 121 transitions. Word has length 19 [2022-04-07 21:20:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:51,813 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 121 transitions. [2022-04-07 21:20:51,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-04-07 21:20:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 21:20:51,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:51,814 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:51,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 21:20:51,814 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1261249230, now seen corresponding path program 1 times [2022-04-07 21:20:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337077323] [2022-04-07 21:20:51,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:51,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:51,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {1123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1117#true} is VALID [2022-04-07 21:20:51,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {1117#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1117#true} is VALID [2022-04-07 21:20:51,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1117#true} {1117#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1117#true} is VALID [2022-04-07 21:20:51,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {1117#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:51,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1117#true} is VALID [2022-04-07 21:20:51,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {1117#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1117#true} is VALID [2022-04-07 21:20:51,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1117#true} {1117#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1117#true} is VALID [2022-04-07 21:20:51,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {1117#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1117#true} is VALID [2022-04-07 21:20:51,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {1117#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {1117#true} is VALID [2022-04-07 21:20:51,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {1117#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {1117#true} is VALID [2022-04-07 21:20:51,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {1117#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {1117#true} is VALID [2022-04-07 21:20:51,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {1117#true} [166] L53-->L53-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[] {1117#true} is VALID [2022-04-07 21:20:51,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {1117#true} [168] L53-2-->L57-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[] {1122#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:51,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {1122#(= main_~p2~0 0)} [169] L57-1-->L61-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] {1122#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:51,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {1122#(= main_~p2~0 0)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1122#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:51,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {1122#(= main_~p2~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1122#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:51,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {1122#(= main_~p2~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {1122#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:51,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {1122#(= main_~p2~0 0)} [177] L73-1-->L77-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] {1122#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:51,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {1122#(= main_~p2~0 0)} [180] L77-1-->L83-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[] {1122#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:51,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {1122#(= main_~p2~0 0)} [183] L83-1-->L89: 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[] {1118#false} is VALID [2022-04-07 21:20:51,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {1118#false} [187] L89-->L114-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[] {1118#false} is VALID [2022-04-07 21:20:51,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {1118#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1118#false} is VALID [2022-04-07 21:20:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:51,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337077323] [2022-04-07 21:20:51,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337077323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:51,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:51,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73157615] [2022-04-07 21:20:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:51,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 21:20:51,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:51,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:51,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:51,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:51,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:51,895 INFO L87 Difference]: Start difference. First operand 73 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,026 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2022-04-07 21:20:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:52,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 21:20:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-07 21:20:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-07 21:20:52,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-07 21:20:52,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,101 INFO L225 Difference]: With dead ends: 101 [2022-04-07 21:20:52,101 INFO L226 Difference]: Without dead ends: 101 [2022-04-07 21:20:52,102 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-07 21:20:52,102 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:52,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 73 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-07 21:20:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-07 21:20:52,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:52,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,107 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,107 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,109 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2022-04-07 21:20:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 164 transitions. [2022-04-07 21:20:52,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 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 101 states. [2022-04-07 21:20:52,110 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 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 101 states. [2022-04-07 21:20:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,112 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2022-04-07 21:20:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 164 transitions. [2022-04-07 21:20:52,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:52,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-04-07 21:20:52,115 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-04-07 21:20:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:52,115 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-04-07 21:20:52,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-04-07 21:20:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:20:52,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:52,115 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:52,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 21:20:52,116 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2053963387, now seen corresponding path program 1 times [2022-04-07 21:20:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:52,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177269825] [2022-04-07 21:20:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {1537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1531#true} is VALID [2022-04-07 21:20:52,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 21:20:52,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1531#true} {1531#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 21:20:52,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:52,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1531#true} is VALID [2022-04-07 21:20:52,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 21:20:52,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 21:20:52,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 21:20:52,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {1531#true} is VALID [2022-04-07 21:20:52,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {1531#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {1531#true} is VALID [2022-04-07 21:20:52,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {1531#true} is VALID [2022-04-07 21:20:52,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#true} [166] L53-->L53-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[] {1531#true} is VALID [2022-04-07 21:20:52,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#true} [167] L53-2-->L57-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] {1536#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:52,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(not (= main_~p2~0 0))} [169] L57-1-->L61-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] {1536#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:52,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(not (= main_~p2~0 0))} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1536#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:52,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {1536#(not (= main_~p2~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1536#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:52,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1536#(not (= main_~p2~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {1536#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:52,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1536#(not (= main_~p2~0 0))} [177] L73-1-->L77-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] {1536#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:52,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {1536#(not (= main_~p2~0 0))} [180] L77-1-->L83-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[] {1536#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:52,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {1536#(not (= main_~p2~0 0))} [184] L83-1-->L88-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[] {1532#false} is VALID [2022-04-07 21:20:52,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {1532#false} [189] L88-1-->L94: 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[] {1532#false} is VALID [2022-04-07 21:20:52,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {1532#false} [191] L94-->L114-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[] {1532#false} is VALID [2022-04-07 21:20:52,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {1532#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 21:20:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:52,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177269825] [2022-04-07 21:20:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177269825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:52,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:52,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379730626] [2022-04-07 21:20:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 21:20:52,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:52,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:52,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:52,183 INFO L87 Difference]: Start difference. First operand 99 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,287 INFO L93 Difference]: Finished difference Result 103 states and 164 transitions. [2022-04-07 21:20:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:52,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 21:20:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-07 21:20:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-07 21:20:52,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2022-04-07 21:20:52,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,357 INFO L225 Difference]: With dead ends: 103 [2022-04-07 21:20:52,357 INFO L226 Difference]: Without dead ends: 103 [2022-04-07 21:20:52,357 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-07 21:20:52,358 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:52,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 80 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-07 21:20:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-07 21:20:52,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:52,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,362 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,362 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,364 INFO L93 Difference]: Finished difference Result 103 states and 164 transitions. [2022-04-07 21:20:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 164 transitions. [2022-04-07 21:20:52,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 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 103 states. [2022-04-07 21:20:52,365 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 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 103 states. [2022-04-07 21:20:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,367 INFO L93 Difference]: Finished difference Result 103 states and 164 transitions. [2022-04-07 21:20:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 164 transitions. [2022-04-07 21:20:52,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:52,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2022-04-07 21:20:52,369 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 20 [2022-04-07 21:20:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:52,370 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2022-04-07 21:20:52,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2022-04-07 21:20:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:20:52,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:52,370 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:52,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 21:20:52,370 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 444052550, now seen corresponding path program 1 times [2022-04-07 21:20:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:52,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417847754] [2022-04-07 21:20:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {1959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1953#true} is VALID [2022-04-07 21:20:52,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {1953#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#true} is VALID [2022-04-07 21:20:52,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1953#true} {1953#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#true} is VALID [2022-04-07 21:20:52,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {1953#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:52,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1953#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1953#true} {1953#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {1953#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {1953#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {1953#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {1953#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1953#true} [166] L53-->L53-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[] {1953#true} is VALID [2022-04-07 21:20:52,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {1953#true} [168] L53-2-->L57-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[] {1953#true} is VALID [2022-04-07 21:20:52,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {1953#true} [169] L57-1-->L61-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] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {1958#(= main_~lk3~0 1)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {1958#(= main_~lk3~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1958#(= main_~lk3~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {1958#(= main_~lk3~0 1)} [177] L73-1-->L77-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] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {1958#(= main_~lk3~0 1)} [180] L77-1-->L83-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[] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {1958#(= main_~lk3~0 1)} [184] L83-1-->L88-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[] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {1958#(= main_~lk3~0 1)} [189] L88-1-->L94: 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[] {1958#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:52,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {1958#(= main_~lk3~0 1)} [191] L94-->L114-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[] {1954#false} is VALID [2022-04-07 21:20:52,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {1954#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1954#false} is VALID [2022-04-07 21:20:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:52,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:52,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417847754] [2022-04-07 21:20:52,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417847754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:52,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:52,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8043504] [2022-04-07 21:20:52,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:52,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 21:20:52,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:52,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:52,415 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,521 INFO L93 Difference]: Finished difference Result 179 states and 292 transitions. [2022-04-07 21:20:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 21:20:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-07 21:20:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-07 21:20:52,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-07 21:20:52,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,588 INFO L225 Difference]: With dead ends: 179 [2022-04-07 21:20:52,588 INFO L226 Difference]: Without dead ends: 179 [2022-04-07 21:20:52,589 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-07 21:20:52,589 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:52,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-07 21:20:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 137. [2022-04-07 21:20:52,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:52,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,594 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,594 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,598 INFO L93 Difference]: Finished difference Result 179 states and 292 transitions. [2022-04-07 21:20:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 292 transitions. [2022-04-07 21:20:52,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 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 179 states. [2022-04-07 21:20:52,620 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 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 179 states. [2022-04-07 21:20:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,624 INFO L93 Difference]: Finished difference Result 179 states and 292 transitions. [2022-04-07 21:20:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 292 transitions. [2022-04-07 21:20:52,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:52,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 219 transitions. [2022-04-07 21:20:52,627 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 219 transitions. Word has length 20 [2022-04-07 21:20:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:52,628 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 219 transitions. [2022-04-07 21:20:52,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 219 transitions. [2022-04-07 21:20:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:20:52,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:52,628 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:52,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 21:20:52,629 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash 247539045, now seen corresponding path program 1 times [2022-04-07 21:20:52,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963653251] [2022-04-07 21:20:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {2645#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2639#true} is VALID [2022-04-07 21:20:52,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {2639#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2639#true} is VALID [2022-04-07 21:20:52,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2639#true} {2639#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2639#true} is VALID [2022-04-07 21:20:52,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {2639#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2645#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:52,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {2645#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2639#true} is VALID [2022-04-07 21:20:52,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {2639#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2639#true} is VALID [2022-04-07 21:20:52,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2639#true} {2639#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2639#true} is VALID [2022-04-07 21:20:52,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {2639#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2639#true} is VALID [2022-04-07 21:20:52,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {2639#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {2639#true} is VALID [2022-04-07 21:20:52,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {2639#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {2639#true} is VALID [2022-04-07 21:20:52,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {2639#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {2639#true} is VALID [2022-04-07 21:20:52,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {2639#true} [166] L53-->L53-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[] {2639#true} is VALID [2022-04-07 21:20:52,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {2639#true} [168] L53-2-->L57-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[] {2639#true} is VALID [2022-04-07 21:20:52,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {2639#true} [170] L57-1-->L61-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[] {2644#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:52,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {2644#(= main_~p3~0 0)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2644#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:52,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {2644#(= main_~p3~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2644#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:52,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {2644#(= main_~p3~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {2644#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:52,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2644#(= main_~p3~0 0)} [177] L73-1-->L77-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] {2644#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:52,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {2644#(= main_~p3~0 0)} [180] L77-1-->L83-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[] {2644#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:52,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {2644#(= main_~p3~0 0)} [184] L83-1-->L88-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[] {2644#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:52,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {2644#(= main_~p3~0 0)} [189] L88-1-->L94: 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[] {2640#false} is VALID [2022-04-07 21:20:52,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {2640#false} [191] L94-->L114-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[] {2640#false} is VALID [2022-04-07 21:20:52,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {2640#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2640#false} is VALID [2022-04-07 21:20:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963653251] [2022-04-07 21:20:52,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963653251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:52,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:52,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856207971] [2022-04-07 21:20:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 21:20:52,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:52,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:52,675 INFO L87 Difference]: Start difference. First operand 137 states and 219 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,776 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2022-04-07 21:20:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:52,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 21:20:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-07 21:20:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-07 21:20:52,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-04-07 21:20:52,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,847 INFO L225 Difference]: With dead ends: 187 [2022-04-07 21:20:52,847 INFO L226 Difference]: Without dead ends: 187 [2022-04-07 21:20:52,847 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-07 21:20:52,848 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:52,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-07 21:20:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2022-04-07 21:20:52,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:52,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,853 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,853 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,856 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2022-04-07 21:20:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2022-04-07 21:20:52,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 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 187 states. [2022-04-07 21:20:52,857 INFO L87 Difference]: Start difference. First operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 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 187 states. [2022-04-07 21:20:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:52,860 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2022-04-07 21:20:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2022-04-07 21:20:52,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:52,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:52,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:52,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 291 transitions. [2022-04-07 21:20:52,864 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 291 transitions. Word has length 20 [2022-04-07 21:20:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:52,864 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 291 transitions. [2022-04-07 21:20:52,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 291 transitions. [2022-04-07 21:20:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 21:20:52,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:52,865 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:52,866 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 21:20:52,866 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 880759370, now seen corresponding path program 1 times [2022-04-07 21:20:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:52,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758802455] [2022-04-07 21:20:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {3403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3397#true} is VALID [2022-04-07 21:20:52,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3397#true} is VALID [2022-04-07 21:20:52,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3397#true} {3397#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3397#true} is VALID [2022-04-07 21:20:52,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:52,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {3403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3397#true} is VALID [2022-04-07 21:20:52,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3397#true} is VALID [2022-04-07 21:20:52,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3397#true} is VALID [2022-04-07 21:20:52,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3397#true} is VALID [2022-04-07 21:20:52,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {3397#true} is VALID [2022-04-07 21:20:52,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {3397#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {3397#true} is VALID [2022-04-07 21:20:52,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {3397#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {3397#true} is VALID [2022-04-07 21:20:52,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {3397#true} [166] L53-->L53-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[] {3397#true} is VALID [2022-04-07 21:20:52,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {3397#true} [168] L53-2-->L57-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[] {3397#true} is VALID [2022-04-07 21:20:52,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {3397#true} [169] L57-1-->L61-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] {3402#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:52,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {3402#(not (= main_~p3~0 0))} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3402#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:52,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {3402#(not (= main_~p3~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {3402#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:52,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {3402#(not (= main_~p3~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {3402#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:52,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {3402#(not (= main_~p3~0 0))} [177] L73-1-->L77-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] {3402#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:52,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(not (= main_~p3~0 0))} [180] L77-1-->L83-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[] {3402#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:52,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {3402#(not (= main_~p3~0 0))} [184] L83-1-->L88-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[] {3402#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:52,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(not (= main_~p3~0 0))} [190] L88-1-->L93-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[] {3398#false} is VALID [2022-04-07 21:20:52,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {3398#false} [193] L93-1-->L99: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {3398#false} is VALID [2022-04-07 21:20:52,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {3398#false} [195] L99-->L114-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {3398#false} is VALID [2022-04-07 21:20:52,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {3398#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3398#false} is VALID [2022-04-07 21:20:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758802455] [2022-04-07 21:20:52,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758802455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:52,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:52,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412546517] [2022-04-07 21:20:52,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:20:52,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:52,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:52,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:52,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:52,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:52,910 INFO L87 Difference]: Start difference. First operand 185 states and 291 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,011 INFO L93 Difference]: Finished difference Result 191 states and 292 transitions. [2022-04-07 21:20:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:53,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:20:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-07 21:20:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-07 21:20:53,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-07 21:20:53,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,078 INFO L225 Difference]: With dead ends: 191 [2022-04-07 21:20:53,078 INFO L226 Difference]: Without dead ends: 191 [2022-04-07 21:20:53,079 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-07 21:20:53,079 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:53,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-07 21:20:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-04-07 21:20:53,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:53,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,083 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,084 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,087 INFO L93 Difference]: Finished difference Result 191 states and 292 transitions. [2022-04-07 21:20:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 292 transitions. [2022-04-07 21:20:53,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 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 191 states. [2022-04-07 21:20:53,088 INFO L87 Difference]: Start difference. First operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 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 191 states. [2022-04-07 21:20:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,092 INFO L93 Difference]: Finished difference Result 191 states and 292 transitions. [2022-04-07 21:20:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 292 transitions. [2022-04-07 21:20:53,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:53,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 291 transitions. [2022-04-07 21:20:53,095 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 291 transitions. Word has length 21 [2022-04-07 21:20:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:53,095 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 291 transitions. [2022-04-07 21:20:53,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 291 transitions. [2022-04-07 21:20:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 21:20:53,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:53,096 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:53,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 21:20:53,096 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash -916191989, now seen corresponding path program 1 times [2022-04-07 21:20:53,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:53,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972689999] [2022-04-07 21:20:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4171#true} is VALID [2022-04-07 21:20:53,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {4171#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4171#true} is VALID [2022-04-07 21:20:53,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4171#true} {4171#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4171#true} is VALID [2022-04-07 21:20:53,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {4171#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:53,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4171#true} is VALID [2022-04-07 21:20:53,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {4171#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4171#true} is VALID [2022-04-07 21:20:53,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4171#true} {4171#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4171#true} is VALID [2022-04-07 21:20:53,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {4171#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4171#true} is VALID [2022-04-07 21:20:53,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {4171#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {4171#true} is VALID [2022-04-07 21:20:53,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {4171#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {4171#true} is VALID [2022-04-07 21:20:53,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {4171#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {4171#true} is VALID [2022-04-07 21:20:53,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {4171#true} [166] L53-->L53-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[] {4171#true} is VALID [2022-04-07 21:20:53,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {4171#true} [168] L53-2-->L57-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[] {4171#true} is VALID [2022-04-07 21:20:53,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {4171#true} [170] L57-1-->L61-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[] {4171#true} is VALID [2022-04-07 21:20:53,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {4171#true} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {4176#(= main_~lk4~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {4176#(= main_~lk4~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {4176#(= main_~lk4~0 1)} [177] L73-1-->L77-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] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {4176#(= main_~lk4~0 1)} [180] L77-1-->L83-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[] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {4176#(= main_~lk4~0 1)} [184] L83-1-->L88-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[] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {4176#(= main_~lk4~0 1)} [190] L88-1-->L93-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[] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {4176#(= main_~lk4~0 1)} [193] L93-1-->L99: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4176#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:53,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {4176#(= main_~lk4~0 1)} [195] L99-->L114-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {4172#false} is VALID [2022-04-07 21:20:53,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {4172#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4172#false} is VALID [2022-04-07 21:20:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:53,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972689999] [2022-04-07 21:20:53,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972689999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:53,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:53,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759154753] [2022-04-07 21:20:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:20:53,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:53,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:53,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:53,137 INFO L87 Difference]: Start difference. First operand 189 states and 291 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,239 INFO L93 Difference]: Finished difference Result 331 states and 512 transitions. [2022-04-07 21:20:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:53,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:20:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-07 21:20:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-07 21:20:53,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2022-04-07 21:20:53,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,303 INFO L225 Difference]: With dead ends: 331 [2022-04-07 21:20:53,303 INFO L226 Difference]: Without dead ends: 331 [2022-04-07 21:20:53,304 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-07 21:20:53,304 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:53,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-07 21:20:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-04-07 21:20:53,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:53,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,308 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,309 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,314 INFO L93 Difference]: Finished difference Result 331 states and 512 transitions. [2022-04-07 21:20:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 512 transitions. [2022-04-07 21:20:53,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 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 331 states. [2022-04-07 21:20:53,315 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 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 331 states. [2022-04-07 21:20:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,320 INFO L93 Difference]: Finished difference Result 331 states and 512 transitions. [2022-04-07 21:20:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 512 transitions. [2022-04-07 21:20:53,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:53,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2022-04-07 21:20:53,324 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 21 [2022-04-07 21:20:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:53,324 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2022-04-07 21:20:53,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2022-04-07 21:20:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 21:20:53,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:53,325 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:53,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 21:20:53,325 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1112705494, now seen corresponding path program 1 times [2022-04-07 21:20:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:53,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409656307] [2022-04-07 21:20:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {5447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5441#true} is VALID [2022-04-07 21:20:53,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {5441#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5441#true} is VALID [2022-04-07 21:20:53,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5441#true} {5441#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5441#true} is VALID [2022-04-07 21:20:53,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {5441#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:53,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {5447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5441#true} is VALID [2022-04-07 21:20:53,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {5441#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5441#true} {5441#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {5441#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {5441#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {5441#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {5441#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {5441#true} [166] L53-->L53-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[] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {5441#true} [168] L53-2-->L57-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[] {5441#true} is VALID [2022-04-07 21:20:53,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {5441#true} [170] L57-1-->L61-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[] {5441#true} is VALID [2022-04-07 21:20:53,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {5441#true} [172] L61-1-->L65-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[] {5446#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:53,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {5446#(= main_~p4~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {5446#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:53,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {5446#(= main_~p4~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {5446#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:53,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {5446#(= main_~p4~0 0)} [177] L73-1-->L77-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] {5446#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:53,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {5446#(= main_~p4~0 0)} [180] L77-1-->L83-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[] {5446#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:53,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {5446#(= main_~p4~0 0)} [184] L83-1-->L88-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[] {5446#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:53,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {5446#(= main_~p4~0 0)} [190] L88-1-->L93-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[] {5446#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:53,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {5446#(= main_~p4~0 0)} [193] L93-1-->L99: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {5442#false} is VALID [2022-04-07 21:20:53,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {5442#false} [195] L99-->L114-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {5442#false} is VALID [2022-04-07 21:20:53,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {5442#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5442#false} is VALID [2022-04-07 21:20:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:53,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409656307] [2022-04-07 21:20:53,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409656307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:53,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:53,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:53,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420275567] [2022-04-07 21:20:53,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:20:53,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:53,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:53,366 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,469 INFO L93 Difference]: Finished difference Result 355 states and 520 transitions. [2022-04-07 21:20:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 21:20:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-07 21:20:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-07 21:20:53,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-07 21:20:53,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,537 INFO L225 Difference]: With dead ends: 355 [2022-04-07 21:20:53,537 INFO L226 Difference]: Without dead ends: 355 [2022-04-07 21:20:53,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-07 21:20:53,538 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:53,538 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-07 21:20:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-04-07 21:20:53,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:53,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,543 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,543 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,549 INFO L93 Difference]: Finished difference Result 355 states and 520 transitions. [2022-04-07 21:20:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 520 transitions. [2022-04-07 21:20:53,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 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 355 states. [2022-04-07 21:20:53,550 INFO L87 Difference]: Start difference. First operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 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 355 states. [2022-04-07 21:20:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,555 INFO L93 Difference]: Finished difference Result 355 states and 520 transitions. [2022-04-07 21:20:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 520 transitions. [2022-04-07 21:20:53,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:53,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 519 transitions. [2022-04-07 21:20:53,561 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 519 transitions. Word has length 21 [2022-04-07 21:20:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:53,561 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 519 transitions. [2022-04-07 21:20:53,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 519 transitions. [2022-04-07 21:20:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 21:20:53,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:53,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:53,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 21:20:53,562 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1662851745, now seen corresponding path program 1 times [2022-04-07 21:20:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:53,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993969085] [2022-04-07 21:20:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {6877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6871#true} is VALID [2022-04-07 21:20:53,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {6871#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6871#true} is VALID [2022-04-07 21:20:53,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6871#true} {6871#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6871#true} is VALID [2022-04-07 21:20:53,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {6871#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:53,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {6877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6871#true} is VALID [2022-04-07 21:20:53,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {6871#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6871#true} {6871#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {6871#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {6871#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {6871#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {6871#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {6871#true} [166] L53-->L53-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[] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {6871#true} [168] L53-2-->L57-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[] {6871#true} is VALID [2022-04-07 21:20:53,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {6871#true} [170] L57-1-->L61-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[] {6871#true} is VALID [2022-04-07 21:20:53,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {6871#true} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {6876#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:53,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {6876#(not (= main_~p4~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {6876#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:53,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {6876#(not (= main_~p4~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {6876#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:53,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {6876#(not (= main_~p4~0 0))} [177] L73-1-->L77-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] {6876#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:53,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {6876#(not (= main_~p4~0 0))} [180] L77-1-->L83-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[] {6876#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:53,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {6876#(not (= main_~p4~0 0))} [184] L83-1-->L88-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[] {6876#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:53,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {6876#(not (= main_~p4~0 0))} [190] L88-1-->L93-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[] {6876#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:53,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {6876#(not (= main_~p4~0 0))} [194] L93-1-->L98-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[] {6872#false} is VALID [2022-04-07 21:20:53,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {6872#false} [197] L98-1-->L104: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {6872#false} is VALID [2022-04-07 21:20:53,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {6872#false} [199] L104-->L114-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {6872#false} is VALID [2022-04-07 21:20:53,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {6872#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6872#false} is VALID [2022-04-07 21:20:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:53,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993969085] [2022-04-07 21:20:53,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993969085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:53,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:53,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:53,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247547664] [2022-04-07 21:20:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:53,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 21:20:53,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:53,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:53,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:53,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:53,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:53,608 INFO L87 Difference]: Start difference. First operand 353 states and 519 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,712 INFO L93 Difference]: Finished difference Result 363 states and 520 transitions. [2022-04-07 21:20:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:53,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 21:20:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-07 21:20:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-07 21:20:53,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-07 21:20:53,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,781 INFO L225 Difference]: With dead ends: 363 [2022-04-07 21:20:53,781 INFO L226 Difference]: Without dead ends: 363 [2022-04-07 21:20:53,781 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-07 21:20:53,781 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:53,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-07 21:20:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-04-07 21:20:53,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:53,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,786 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,787 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,792 INFO L93 Difference]: Finished difference Result 363 states and 520 transitions. [2022-04-07 21:20:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 520 transitions. [2022-04-07 21:20:53,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 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 363 states. [2022-04-07 21:20:53,794 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 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 363 states. [2022-04-07 21:20:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,799 INFO L93 Difference]: Finished difference Result 363 states and 520 transitions. [2022-04-07 21:20:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 520 transitions. [2022-04-07 21:20:53,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:53,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:53,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:53,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 519 transitions. [2022-04-07 21:20:53,805 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 519 transitions. Word has length 22 [2022-04-07 21:20:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:53,805 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 519 transitions. [2022-04-07 21:20:53,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 519 transitions. [2022-04-07 21:20:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 21:20:53,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:53,806 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:53,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 21:20:53,806 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:53,806 INFO L85 PathProgramCache]: Analyzing trace with hash -134099614, now seen corresponding path program 1 times [2022-04-07 21:20:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:53,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632032594] [2022-04-07 21:20:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:53,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {8339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8333#true} is VALID [2022-04-07 21:20:53,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {8333#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8333#true} is VALID [2022-04-07 21:20:53,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8333#true} {8333#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8333#true} is VALID [2022-04-07 21:20:53,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {8333#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:53,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {8339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8333#true} is VALID [2022-04-07 21:20:53,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {8333#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8333#true} is VALID [2022-04-07 21:20:53,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8333#true} {8333#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8333#true} is VALID [2022-04-07 21:20:53,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {8333#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {8333#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {8333#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {8333#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {8333#true} [166] L53-->L53-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[] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {8333#true} [168] L53-2-->L57-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[] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {8333#true} [170] L57-1-->L61-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[] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {8333#true} [172] L61-1-->L65-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[] {8333#true} is VALID [2022-04-07 21:20:53,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {8333#true} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {8338#(= main_~lk5~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {8338#(= main_~lk5~0 1)} [177] L73-1-->L77-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] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {8338#(= main_~lk5~0 1)} [180] L77-1-->L83-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[] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {8338#(= main_~lk5~0 1)} [184] L83-1-->L88-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[] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {8338#(= main_~lk5~0 1)} [190] L88-1-->L93-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[] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {8338#(= main_~lk5~0 1)} [194] L93-1-->L98-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[] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {8338#(= main_~lk5~0 1)} [197] L98-1-->L104: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {8338#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:53,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {8338#(= main_~lk5~0 1)} [199] L104-->L114-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {8334#false} is VALID [2022-04-07 21:20:53,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {8334#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8334#false} is VALID [2022-04-07 21:20:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:53,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:53,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632032594] [2022-04-07 21:20:53,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632032594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:53,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:53,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304205670] [2022-04-07 21:20:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 21:20:53,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:53,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:53,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:53,847 INFO L87 Difference]: Start difference. First operand 361 states and 519 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,952 INFO L93 Difference]: Finished difference Result 619 states and 888 transitions. [2022-04-07 21:20:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:53,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 21:20:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 21:20:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 21:20:53,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-07 21:20:54,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,015 INFO L225 Difference]: With dead ends: 619 [2022-04-07 21:20:54,015 INFO L226 Difference]: Without dead ends: 619 [2022-04-07 21:20:54,015 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-07 21:20:54,016 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:54,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-07 21:20:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-04-07 21:20:54,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:54,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,023 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,023 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,035 INFO L93 Difference]: Finished difference Result 619 states and 888 transitions. [2022-04-07 21:20:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 888 transitions. [2022-04-07 21:20:54,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:54,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:54,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 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 619 states. [2022-04-07 21:20:54,037 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 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 619 states. [2022-04-07 21:20:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,049 INFO L93 Difference]: Finished difference Result 619 states and 888 transitions. [2022-04-07 21:20:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 888 transitions. [2022-04-07 21:20:54,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:54,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:54,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:54,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 727 transitions. [2022-04-07 21:20:54,059 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 727 transitions. Word has length 22 [2022-04-07 21:20:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:54,059 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 727 transitions. [2022-04-07 21:20:54,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 727 transitions. [2022-04-07 21:20:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 21:20:54,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:54,060 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:54,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 21:20:54,060 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash -330613119, now seen corresponding path program 1 times [2022-04-07 21:20:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:54,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170254657] [2022-04-07 21:20:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:54,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:54,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {10729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10723#true} is VALID [2022-04-07 21:20:54,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {10723#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10723#true} is VALID [2022-04-07 21:20:54,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10723#true} {10723#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10723#true} is VALID [2022-04-07 21:20:54,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {10723#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:54,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10723#true} is VALID [2022-04-07 21:20:54,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {10723#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10723#true} {10723#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {10723#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {10723#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {10723#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {10723#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {10723#true} [166] L53-->L53-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[] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {10723#true} [168] L53-2-->L57-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[] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {10723#true} [170] L57-1-->L61-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[] {10723#true} is VALID [2022-04-07 21:20:54,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {10723#true} [172] L61-1-->L65-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[] {10723#true} is VALID [2022-04-07 21:20:54,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {10723#true} [174] L65-1-->L69-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[] {10728#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:54,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {10728#(= main_~p5~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {10728#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:54,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {10728#(= main_~p5~0 0)} [177] L73-1-->L77-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] {10728#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:54,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {10728#(= main_~p5~0 0)} [180] L77-1-->L83-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[] {10728#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:54,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {10728#(= main_~p5~0 0)} [184] L83-1-->L88-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[] {10728#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:54,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {10728#(= main_~p5~0 0)} [190] L88-1-->L93-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[] {10728#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:54,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {10728#(= main_~p5~0 0)} [194] L93-1-->L98-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[] {10728#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:54,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {10728#(= main_~p5~0 0)} [197] L98-1-->L104: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {10724#false} is VALID [2022-04-07 21:20:54,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {10724#false} [199] L104-->L114-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {10724#false} is VALID [2022-04-07 21:20:54,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {10724#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10724#false} is VALID [2022-04-07 21:20:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170254657] [2022-04-07 21:20:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170254657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:54,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:54,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986152682] [2022-04-07 21:20:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:54,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 21:20:54,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:54,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:54,117 INFO L87 Difference]: Start difference. First operand 521 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,225 INFO L93 Difference]: Finished difference Result 683 states and 920 transitions. [2022-04-07 21:20:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:54,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 21:20:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-07 21:20:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-07 21:20:54,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 85 transitions. [2022-04-07 21:20:54,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,294 INFO L225 Difference]: With dead ends: 683 [2022-04-07 21:20:54,294 INFO L226 Difference]: Without dead ends: 683 [2022-04-07 21:20:54,295 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-07 21:20:54,295 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:54,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-04-07 21:20:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-04-07 21:20:54,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:54,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,303 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,304 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,317 INFO L93 Difference]: Finished difference Result 683 states and 920 transitions. [2022-04-07 21:20:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 920 transitions. [2022-04-07 21:20:54,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:54,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:54,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 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 683 states. [2022-04-07 21:20:54,319 INFO L87 Difference]: Start difference. First operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 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 683 states. [2022-04-07 21:20:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,333 INFO L93 Difference]: Finished difference Result 683 states and 920 transitions. [2022-04-07 21:20:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 920 transitions. [2022-04-07 21:20:54,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:54,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:54,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:54,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 919 transitions. [2022-04-07 21:20:54,348 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 919 transitions. Word has length 22 [2022-04-07 21:20:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:54,348 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 919 transitions. [2022-04-07 21:20:54,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 919 transitions. [2022-04-07 21:20:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 21:20:54,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:54,349 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-07 21:20:54,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 21:20:54,349 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash 137911718, now seen corresponding path program 1 times [2022-04-07 21:20:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:54,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947843767] [2022-04-07 21:20:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:54,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {13471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13465#true} is VALID [2022-04-07 21:20:54,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {13465#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13465#true} is VALID [2022-04-07 21:20:54,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13465#true} {13465#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13465#true} is VALID [2022-04-07 21:20:54,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {13465#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:54,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {13471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13465#true} is VALID [2022-04-07 21:20:54,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {13465#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13465#true} is VALID [2022-04-07 21:20:54,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13465#true} {13465#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13465#true} is VALID [2022-04-07 21:20:54,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {13465#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13465#true} is VALID [2022-04-07 21:20:54,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {13465#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {13465#true} is VALID [2022-04-07 21:20:54,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {13465#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {13465#true} is VALID [2022-04-07 21:20:54,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {13465#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {13465#true} is VALID [2022-04-07 21:20:54,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {13465#true} [166] L53-->L53-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[] {13465#true} is VALID [2022-04-07 21:20:54,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {13465#true} [168] L53-2-->L57-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[] {13465#true} is VALID [2022-04-07 21:20:54,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {13465#true} [170] L57-1-->L61-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[] {13465#true} is VALID [2022-04-07 21:20:54,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {13465#true} [172] L61-1-->L65-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[] {13465#true} is VALID [2022-04-07 21:20:54,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {13465#true} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {13470#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:54,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {13470#(not (= main_~p5~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {13470#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:54,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {13470#(not (= main_~p5~0 0))} [177] L73-1-->L77-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] {13470#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:54,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {13470#(not (= main_~p5~0 0))} [180] L77-1-->L83-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[] {13470#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:54,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {13470#(not (= main_~p5~0 0))} [184] L83-1-->L88-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[] {13470#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:54,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {13470#(not (= main_~p5~0 0))} [190] L88-1-->L93-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[] {13470#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:54,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {13470#(not (= main_~p5~0 0))} [194] L93-1-->L98-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[] {13470#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:54,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {13470#(not (= main_~p5~0 0))} [198] L98-1-->L103-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[] {13466#false} is VALID [2022-04-07 21:20:54,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {13466#false} [201] L103-1-->L109: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {13466#false} is VALID [2022-04-07 21:20:54,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {13466#false} [203] L109-->L114-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {13466#false} is VALID [2022-04-07 21:20:54,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {13466#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#false} is VALID [2022-04-07 21:20:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:54,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947843767] [2022-04-07 21:20:54,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947843767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:54,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:54,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:54,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061734798] [2022-04-07 21:20:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:54,378 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-07 21:20:54,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:54,378 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-07 21:20:54,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:54,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:54,390 INFO L87 Difference]: Start difference. First operand 681 states and 919 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-07 21:20:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,497 INFO L93 Difference]: Finished difference Result 699 states and 920 transitions. [2022-04-07 21:20:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:54,497 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-07 21:20:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:54,497 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-07 21:20:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-07 21:20:54,498 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-07 21:20:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-07 21:20:54,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-07 21:20:54,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,566 INFO L225 Difference]: With dead ends: 699 [2022-04-07 21:20:54,566 INFO L226 Difference]: Without dead ends: 699 [2022-04-07 21:20:54,566 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-07 21:20:54,566 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:54,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-07 21:20:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-07 21:20:54,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:54,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,575 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,575 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,589 INFO L93 Difference]: Finished difference Result 699 states and 920 transitions. [2022-04-07 21:20:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 920 transitions. [2022-04-07 21:20:54,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:54,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:54,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 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 699 states. [2022-04-07 21:20:54,592 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 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 699 states. [2022-04-07 21:20:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,606 INFO L93 Difference]: Finished difference Result 699 states and 920 transitions. [2022-04-07 21:20:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 920 transitions. [2022-04-07 21:20:54,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:54,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:54,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:54,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 919 transitions. [2022-04-07 21:20:54,621 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 919 transitions. Word has length 23 [2022-04-07 21:20:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:54,621 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 919 transitions. [2022-04-07 21:20:54,621 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-07 21:20:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 919 transitions. [2022-04-07 21:20:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 21:20:54,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:54,622 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-07 21:20:54,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 21:20:54,622 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1659039641, now seen corresponding path program 1 times [2022-04-07 21:20:54,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:54,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664821393] [2022-04-07 21:20:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:54,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {16277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {16271#true} is VALID [2022-04-07 21:20:54,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {16271#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16271#true} is VALID [2022-04-07 21:20:54,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16271#true} {16271#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16271#true} is VALID [2022-04-07 21:20:54,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {16271#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:54,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {16277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {16271#true} is VALID [2022-04-07 21:20:54,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {16271#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16271#true} is VALID [2022-04-07 21:20:54,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16271#true} {16271#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16271#true} is VALID [2022-04-07 21:20:54,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {16271#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16271#true} is VALID [2022-04-07 21:20:54,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {16271#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {16271#true} is VALID [2022-04-07 21:20:54,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {16271#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {16271#true} is VALID [2022-04-07 21:20:54,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {16271#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {16271#true} is VALID [2022-04-07 21:20:54,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {16271#true} [166] L53-->L53-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[] {16271#true} is VALID [2022-04-07 21:20:54,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {16271#true} [168] L53-2-->L57-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[] {16271#true} is VALID [2022-04-07 21:20:54,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {16271#true} [170] L57-1-->L61-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[] {16271#true} is VALID [2022-04-07 21:20:54,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {16271#true} [172] L61-1-->L65-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[] {16271#true} is VALID [2022-04-07 21:20:54,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {16271#true} [174] L65-1-->L69-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[] {16271#true} is VALID [2022-04-07 21:20:54,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {16271#true} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {16276#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:54,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {16276#(= main_~p6~0 0)} [177] L73-1-->L77-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] {16276#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:54,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {16276#(= main_~p6~0 0)} [180] L77-1-->L83-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[] {16276#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:54,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {16276#(= main_~p6~0 0)} [184] L83-1-->L88-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[] {16276#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:54,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {16276#(= main_~p6~0 0)} [190] L88-1-->L93-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[] {16276#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:54,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {16276#(= main_~p6~0 0)} [194] L93-1-->L98-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[] {16276#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:54,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {16276#(= main_~p6~0 0)} [198] L98-1-->L103-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[] {16276#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:54,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {16276#(= main_~p6~0 0)} [201] L103-1-->L109: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {16272#false} is VALID [2022-04-07 21:20:54,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {16272#false} [203] L109-->L114-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {16272#false} is VALID [2022-04-07 21:20:54,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {16272#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#false} is VALID [2022-04-07 21:20:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:54,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664821393] [2022-04-07 21:20:54,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664821393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:54,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:54,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615971554] [2022-04-07 21:20:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:54,660 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-07 21:20:54,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:54,660 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-07 21:20:54,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:54,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:54,672 INFO L87 Difference]: Start difference. First operand 697 states and 919 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-07 21:20:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,817 INFO L93 Difference]: Finished difference Result 1323 states and 1640 transitions. [2022-04-07 21:20:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:54,817 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-07 21:20:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:54,817 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-07 21:20:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-07 21:20:54,818 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-07 21:20:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-07 21:20:54,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-07 21:20:54,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,916 INFO L225 Difference]: With dead ends: 1323 [2022-04-07 21:20:54,916 INFO L226 Difference]: Without dead ends: 1323 [2022-04-07 21:20:54,917 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-07 21:20:54,917 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:54,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-04-07 21:20:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-04-07 21:20:54,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:54,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,932 INFO L74 IsIncluded]: Start isIncluded. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,933 INFO L87 Difference]: Start difference. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:54,975 INFO L93 Difference]: Finished difference Result 1323 states and 1640 transitions. [2022-04-07 21:20:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1640 transitions. [2022-04-07 21:20:54,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:54,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:54,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 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 1323 states. [2022-04-07 21:20:54,979 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 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 1323 states. [2022-04-07 21:20:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:55,023 INFO L93 Difference]: Finished difference Result 1323 states and 1640 transitions. [2022-04-07 21:20:55,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1640 transitions. [2022-04-07 21:20:55,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:55,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:55,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:55,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1639 transitions. [2022-04-07 21:20:55,068 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1639 transitions. Word has length 23 [2022-04-07 21:20:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:55,068 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1639 transitions. [2022-04-07 21:20:55,068 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-07 21:20:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1639 transitions. [2022-04-07 21:20:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 21:20:55,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:55,069 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-07 21:20:55,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 21:20:55,070 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1462526136, now seen corresponding path program 1 times [2022-04-07 21:20:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:55,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930881870] [2022-04-07 21:20:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:55,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {21579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21573#true} is VALID [2022-04-07 21:20:55,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21573#true} is VALID [2022-04-07 21:20:55,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21573#true} {21573#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21573#true} is VALID [2022-04-07 21:20:55,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {21579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {21573#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {21573#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {21573#true} [166] L53-->L53-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[] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {21573#true} [168] L53-2-->L57-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[] {21573#true} is VALID [2022-04-07 21:20:55,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {21573#true} [170] L57-1-->L61-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[] {21573#true} is VALID [2022-04-07 21:20:55,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {21573#true} [172] L61-1-->L65-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[] {21573#true} is VALID [2022-04-07 21:20:55,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {21573#true} [174] L65-1-->L69-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[] {21573#true} is VALID [2022-04-07 21:20:55,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {21573#true} [175] L69-1-->L73-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {21578#(= main_~lk6~0 1)} [177] L73-1-->L77-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] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {21578#(= main_~lk6~0 1)} [180] L77-1-->L83-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[] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {21578#(= main_~lk6~0 1)} [184] L83-1-->L88-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[] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {21578#(= main_~lk6~0 1)} [190] L88-1-->L93-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[] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {21578#(= main_~lk6~0 1)} [194] L93-1-->L98-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[] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {21578#(= main_~lk6~0 1)} [198] L98-1-->L103-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[] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {21578#(= main_~lk6~0 1)} [201] L103-1-->L109: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {21578#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:55,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {21578#(= main_~lk6~0 1)} [203] L109-->L114-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {21574#false} is VALID [2022-04-07 21:20:55,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {21574#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21574#false} is VALID [2022-04-07 21:20:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:55,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930881870] [2022-04-07 21:20:55,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930881870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:55,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:55,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209463667] [2022-04-07 21:20:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:55,101 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-07 21:20:55,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:55,101 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-07 21:20:55,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:55,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:55,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:55,113 INFO L87 Difference]: Start difference. First operand 1321 states and 1639 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-07 21:20:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:55,248 INFO L93 Difference]: Finished difference Result 1451 states and 1800 transitions. [2022-04-07 21:20:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:55,249 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-07 21:20:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:55,249 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-07 21:20:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-07 21:20:55,250 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-07 21:20:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-07 21:20:55,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-07 21:20:55,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:55,346 INFO L225 Difference]: With dead ends: 1451 [2022-04-07 21:20:55,346 INFO L226 Difference]: Without dead ends: 1451 [2022-04-07 21:20:55,346 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-07 21:20:55,347 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:55,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 76 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-07 21:20:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1321. [2022-04-07 21:20:55,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:55,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:55,361 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:55,362 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:55,412 INFO L93 Difference]: Finished difference Result 1451 states and 1800 transitions. [2022-04-07 21:20:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1800 transitions. [2022-04-07 21:20:55,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:55,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:55,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 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 1451 states. [2022-04-07 21:20:55,415 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 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 1451 states. [2022-04-07 21:20:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:55,465 INFO L93 Difference]: Finished difference Result 1451 states and 1800 transitions. [2022-04-07 21:20:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1800 transitions. [2022-04-07 21:20:55,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:55,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:55,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:55,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1607 transitions. [2022-04-07 21:20:55,509 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1607 transitions. Word has length 23 [2022-04-07 21:20:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:55,509 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1607 transitions. [2022-04-07 21:20:55,510 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-07 21:20:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1607 transitions. [2022-04-07 21:20:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 21:20:55,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:55,511 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-07 21:20:55,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 21:20:55,511 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 109411261, now seen corresponding path program 1 times [2022-04-07 21:20:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402253909] [2022-04-07 21:20:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:55,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {27265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27259#true} is VALID [2022-04-07 21:20:55,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {27259#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27259#true} is VALID [2022-04-07 21:20:55,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27259#true} {27259#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27259#true} is VALID [2022-04-07 21:20:55,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {27259#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {27265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {27259#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27259#true} {27259#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {27259#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {27259#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {27259#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {27259#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {27259#true} [166] L53-->L53-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[] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {27259#true} [168] L53-2-->L57-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[] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {27259#true} [170] L57-1-->L61-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[] {27259#true} is VALID [2022-04-07 21:20:55,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {27259#true} [172] L61-1-->L65-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[] {27259#true} is VALID [2022-04-07 21:20:55,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {27259#true} [174] L65-1-->L69-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[] {27259#true} is VALID [2022-04-07 21:20:55,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {27259#true} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {27259#true} is VALID [2022-04-07 21:20:55,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {27259#true} [177] L73-1-->L77-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] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {27264#(= main_~lk7~0 1)} [180] L77-1-->L83-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[] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {27264#(= main_~lk7~0 1)} [184] L83-1-->L88-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[] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {27264#(= main_~lk7~0 1)} [190] L88-1-->L93-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[] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {27264#(= main_~lk7~0 1)} [194] L93-1-->L98-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[] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {27264#(= main_~lk7~0 1)} [198] L98-1-->L103-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[] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {27264#(= main_~lk7~0 1)} [202] L103-1-->L108-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {27264#(= main_~lk7~0 1)} [205] L108-1-->L114: Formula: (not (= v_main_~p7~0_1 0)) InVars {main_~p7~0=v_main_~p7~0_1} OutVars{main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[] {27264#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:55,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {27264#(= main_~lk7~0 1)} [207] L114-->L114-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {27260#false} is VALID [2022-04-07 21:20:55,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {27260#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27260#false} is VALID [2022-04-07 21:20:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402253909] [2022-04-07 21:20:55,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402253909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:55,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:55,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505079298] [2022-04-07 21:20:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:55,539 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-07 21:20:55,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:55,539 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-07 21:20:55,551 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-07 21:20:55,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:55,552 INFO L87 Difference]: Start difference. First operand 1321 states and 1607 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-07 21:20:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:55,749 INFO L93 Difference]: Finished difference Result 2153 states and 2535 transitions. [2022-04-07 21:20:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:55,750 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-07 21:20:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:55,750 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-07 21:20:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-07 21:20:55,751 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-07 21:20:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-07 21:20:55,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2022-04-07 21:20:55,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:55,909 INFO L225 Difference]: With dead ends: 2153 [2022-04-07 21:20:55,909 INFO L226 Difference]: Without dead ends: 2153 [2022-04-07 21:20:55,910 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-07 21:20:55,910 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:55,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2022-04-07 21:20:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2025. [2022-04-07 21:20:55,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:55,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2153 states. Second operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:55,932 INFO L74 IsIncluded]: Start isIncluded. First operand 2153 states. Second operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:55,934 INFO L87 Difference]: Start difference. First operand 2153 states. Second operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:56,072 INFO L93 Difference]: Finished difference Result 2153 states and 2535 transitions. [2022-04-07 21:20:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2535 transitions. [2022-04-07 21:20:56,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:56,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:56,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 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 2153 states. [2022-04-07 21:20:56,079 INFO L87 Difference]: Start difference. First operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 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 2153 states. [2022-04-07 21:20:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:56,191 INFO L93 Difference]: Finished difference Result 2153 states and 2535 transitions. [2022-04-07 21:20:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2535 transitions. [2022-04-07 21:20:56,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:56,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:56,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:56,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2407 transitions. [2022-04-07 21:20:56,295 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2407 transitions. Word has length 24 [2022-04-07 21:20:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:56,295 INFO L478 AbstractCegarLoop]: Abstraction has 2025 states and 2407 transitions. [2022-04-07 21:20:56,295 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-07 21:20:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2407 transitions. [2022-04-07 21:20:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 21:20:56,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:56,297 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-07 21:20:56,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 21:20:56,298 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -87102244, now seen corresponding path program 1 times [2022-04-07 21:20:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:56,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740036436] [2022-04-07 21:20:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:56,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {35761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35755#true} is VALID [2022-04-07 21:20:56,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {35755#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35755#true} is VALID [2022-04-07 21:20:56,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35755#true} {35755#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35755#true} is VALID [2022-04-07 21:20:56,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {35755#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:56,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {35761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35755#true} is VALID [2022-04-07 21:20:56,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {35755#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35755#true} is VALID [2022-04-07 21:20:56,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35755#true} {35755#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35755#true} is VALID [2022-04-07 21:20:56,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {35755#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35755#true} is VALID [2022-04-07 21:20:56,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {35755#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {35755#true} is VALID [2022-04-07 21:20:56,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {35755#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {35755#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {35755#true} [166] L53-->L53-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[] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {35755#true} [168] L53-2-->L57-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[] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {35755#true} [170] L57-1-->L61-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[] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {35755#true} [172] L61-1-->L65-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[] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {35755#true} [174] L65-1-->L69-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[] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {35755#true} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {35755#true} is VALID [2022-04-07 21:20:56,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {35755#true} [178] L73-1-->L77-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[] {35760#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:56,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {35760#(= main_~p7~0 0)} [180] L77-1-->L83-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[] {35760#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:56,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {35760#(= main_~p7~0 0)} [184] L83-1-->L88-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[] {35760#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:56,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {35760#(= main_~p7~0 0)} [190] L88-1-->L93-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[] {35760#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:56,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {35760#(= main_~p7~0 0)} [194] L93-1-->L98-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[] {35760#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:56,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {35760#(= main_~p7~0 0)} [198] L98-1-->L103-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[] {35760#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:56,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {35760#(= main_~p7~0 0)} [202] L103-1-->L108-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {35760#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:56,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {35760#(= main_~p7~0 0)} [205] L108-1-->L114: Formula: (not (= v_main_~p7~0_1 0)) InVars {main_~p7~0=v_main_~p7~0_1} OutVars{main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[] {35756#false} is VALID [2022-04-07 21:20:56,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {35756#false} [207] L114-->L114-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {35756#false} is VALID [2022-04-07 21:20:56,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {35756#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35756#false} is VALID [2022-04-07 21:20:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:56,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:56,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740036436] [2022-04-07 21:20:56,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740036436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:56,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:56,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:56,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556754401] [2022-04-07 21:20:56,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:56,327 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-07 21:20:56,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:56,327 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-07 21:20:56,340 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-07 21:20:56,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:56,340 INFO L87 Difference]: Start difference. First operand 2025 states and 2407 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-07 21:20:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:56,573 INFO L93 Difference]: Finished difference Result 2535 states and 2822 transitions. [2022-04-07 21:20:56,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:56,574 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-07 21:20:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:56,574 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-07 21:20:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-07 21:20:56,575 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-07 21:20:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-07 21:20:56,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-07 21:20:56,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:56,627 INFO L225 Difference]: With dead ends: 2535 [2022-04-07 21:20:56,627 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 21:20:56,627 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-07 21:20:56,627 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:56,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 21:20:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 21:20:56,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:56,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:20:56,628 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:20:56,628 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:20:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:56,628 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:20:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:20:56,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:56,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:56,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 21:20:56,629 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 21:20:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:56,629 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:20:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:20:56,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:56,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:56,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:56,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:20:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 21:20:56,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-07 21:20:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:56,629 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 21:20:56,629 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-07 21:20:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:20:56,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:56,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:20:56,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 21:20:56,634 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:56,635 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:20:56,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:56 BasicIcfg [2022-04-07 21:20:56,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:20:56,637 INFO L158 Benchmark]: Toolchain (without parser) took 7085.50ms. Allocated memory was 216.0MB in the beginning and 349.2MB in the end (delta: 133.2MB). Free memory was 161.8MB in the beginning and 252.6MB in the end (delta: -90.7MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2022-04-07 21:20:56,637 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 216.0MB. Free memory was 178.3MB in the beginning and 178.2MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:20:56,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.38ms. Allocated memory is still 216.0MB. Free memory was 161.6MB in the beginning and 187.5MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 21:20:56,637 INFO L158 Benchmark]: Boogie Preprocessor took 20.79ms. Allocated memory is still 216.0MB. Free memory was 187.5MB in the beginning and 185.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:56,637 INFO L158 Benchmark]: RCFGBuilder took 304.10ms. Allocated memory is still 216.0MB. Free memory was 185.8MB in the beginning and 172.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 21:20:56,638 INFO L158 Benchmark]: IcfgTransformer took 26.57ms. Allocated memory is still 216.0MB. Free memory was 172.8MB in the beginning and 170.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:56,638 INFO L158 Benchmark]: TraceAbstraction took 6562.87ms. Allocated memory was 216.0MB in the beginning and 349.2MB in the end (delta: 133.2MB). Free memory was 170.1MB in the beginning and 253.1MB in the end (delta: -83.0MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. [2022-04-07 21:20:56,638 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 216.0MB. Free memory was 178.3MB in the beginning and 178.2MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.38ms. Allocated memory is still 216.0MB. Free memory was 161.6MB in the beginning and 187.5MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.79ms. Allocated memory is still 216.0MB. Free memory was 187.5MB in the beginning and 185.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 304.10ms. Allocated memory is still 216.0MB. Free memory was 185.8MB in the beginning and 172.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 26.57ms. Allocated memory is still 216.0MB. Free memory was 172.8MB in the beginning and 170.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6562.87ms. Allocated memory was 216.0MB in the beginning and 349.2MB in the end (delta: 133.2MB). Free memory was 170.1MB in the beginning and 253.1MB in the end (delta: -83.0MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1713 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1713 mSDsluCounter, 1337 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 836 IncrementalHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1202 mSDtfsCounter, 836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2025occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 21:20:56,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...