/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:20:32,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:20:32,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:20:33,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:20:33,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:20:33,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:20:33,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:20:33,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:20:33,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:20:33,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:20:33,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:20:33,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:20:33,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:20:33,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:20:33,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:20:33,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:20:33,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:20:33,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:20:33,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:20:33,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:20:33,046 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:20:33,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:20:33,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:20:33,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:20:33,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:20:33,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:20:33,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:20:33,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:20:33,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:20:33,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:20:33,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:20:33,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:20:33,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:20:33,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:20:33,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:20:33,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:20:33,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:20:33,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:20:33,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:20:33,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:20:33,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:20:33,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:20:33,070 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:33,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:20:33,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:20:33,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:20:33,082 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 21:20:33,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:20:33,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 21:20:33,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:20:33,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:20:33,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:20:33,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:20:33,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:33,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:20:33,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:20:33,084 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:20:33,084 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:33,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:20:33,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:20:33,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:20:33,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:20:33,254 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:20:33,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-04-07 21:20:33,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02fc0d169/7049f0b45f5b4987b8eced891e308c39/FLAG1fc2ee077 [2022-04-07 21:20:33,658 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:20:33,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-07 21:20:33,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02fc0d169/7049f0b45f5b4987b8eced891e308c39/FLAG1fc2ee077 [2022-04-07 21:20:34,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02fc0d169/7049f0b45f5b4987b8eced891e308c39 [2022-04-07 21:20:34,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:20:34,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:20:34,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:34,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:20:34,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:20:34,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:34" (1/1) ... [2022-04-07 21:20:34,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404762eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:34, skipping insertion in model container [2022-04-07 21:20:34,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:34" (1/1) ... [2022-04-07 21:20:34,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:20:34,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:20:34,263 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_5.c[2207,2220] [2022-04-07 21:20:34,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:34,270 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:20:34,299 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_5.c[2207,2220] [2022-04-07 21:20:34,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:34,307 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:20:34,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:34 WrapperNode [2022-04-07 21:20:34,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:34,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:20:34,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:20:34,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:20:34,317 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:34" (1/1) ... [2022-04-07 21:20:34,317 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:34" (1/1) ... [2022-04-07 21:20:34,321 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:34" (1/1) ... [2022-04-07 21:20:34,322 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:34" (1/1) ... [2022-04-07 21:20:34,329 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:34" (1/1) ... [2022-04-07 21:20:34,333 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:34" (1/1) ... [2022-04-07 21:20:34,334 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:34" (1/1) ... [2022-04-07 21:20:34,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:20:34,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:20:34,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:20:34,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:20:34,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:34" (1/1) ... [2022-04-07 21:20:34,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:34,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:20:34,367 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:34,371 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:34,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:20:34,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:20:34,393 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:20:34,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:20:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:20:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:20:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:20:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:20:34,439 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:20:34,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:20:34,553 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:20:34,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:20:34,558 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:20:34,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:34 BoogieIcfgContainer [2022-04-07 21:20:34,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:20:34,560 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:20:34,560 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:20:34,560 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:20:34,562 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:34" (1/1) ... [2022-04-07 21:20:34,563 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 21:20:34,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:34 BasicIcfg [2022-04-07 21:20:34,583 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:20:34,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:20:34,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:20:34,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:20:34,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:20:34" (1/4) ... [2022-04-07 21:20:34,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513c3365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:34, skipping insertion in model container [2022-04-07 21:20:34,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:34" (2/4) ... [2022-04-07 21:20:34,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513c3365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:34, skipping insertion in model container [2022-04-07 21:20:34,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:34" (3/4) ... [2022-04-07 21:20:34,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513c3365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:34, skipping insertion in model container [2022-04-07 21:20:34,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:34" (4/4) ... [2022-04-07 21:20:34,588 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.cJordan [2022-04-07 21:20:34,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:20:34,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:20:34,617 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:20:34,621 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:34,622 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:20:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 21:20:34,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:34,647 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:34,647 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:34,650 INFO L85 PathProgramCache]: Analyzing trace with hash -655326661, now seen corresponding path program 1 times [2022-04-07 21:20:34,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:34,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874411714] [2022-04-07 21:20:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:34,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:34,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:34,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {33#true} is VALID [2022-04-07 21:20:34,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 21:20:34,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 21:20:34,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:34,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {33#true} is VALID [2022-04-07 21:20:34,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 21:20:34,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 21:20:34,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 21:20:34,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {33#true} is VALID [2022-04-07 21:20:34,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {33#true} is VALID [2022-04-07 21:20:34,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {33#true} is VALID [2022-04-07 21:20:34,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [131] L43-->L43-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] {38#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:34,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(= main_~lk1~0 1)} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:34,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(= main_~lk1~0 1)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:34,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(= main_~lk1~0 1)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:34,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(= main_~lk1~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:34,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(= main_~lk1~0 1)} [141] L59-1-->L66: 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[] {38#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:34,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(= main_~lk1~0 1)} [143] L66-->L86-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[] {34#false} is VALID [2022-04-07 21:20:34,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 21:20:34,885 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:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:34,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874411714] [2022-04-07 21:20:34,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874411714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:34,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:34,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549263044] [2022-04-07 21:20:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-07 21:20:34,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:34,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:34,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:34,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:34,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:34,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:34,942 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,134 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2022-04-07 21:20:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-07 21:20:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-07 21:20:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-07 21:20:35,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 85 transitions. [2022-04-07 21:20:35,216 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:35,233 INFO L225 Difference]: With dead ends: 51 [2022-04-07 21:20:35,233 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 21:20:35,235 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:35,237 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 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:35,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 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:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 21:20:35,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-07 21:20:35,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:35,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states 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:35,256 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states 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:35,256 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states 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:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,259 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-07 21:20:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-07 21:20:35,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 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 43 states. [2022-04-07 21:20:35,260 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 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 43 states. [2022-04-07 21:20:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,263 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-07 21:20:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-07 21:20:35,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:35,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states 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:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-07 21:20:35,266 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-07 21:20:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:35,266 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-07 21:20:35,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-07 21:20:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 21:20:35,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:35,267 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:35,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:20:35,268 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1087483674, now seen corresponding path program 1 times [2022-04-07 21:20:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:35,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678417667] [2022-04-07 21:20:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {213#true} is VALID [2022-04-07 21:20:35,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-07 21:20:35,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213#true} {213#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-07 21:20:35,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {213#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:35,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {213#true} is VALID [2022-04-07 21:20:35,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-07 21:20:35,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-07 21:20:35,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {213#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#true} is VALID [2022-04-07 21:20:35,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {213#true} is VALID [2022-04-07 21:20:35,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {213#true} is VALID [2022-04-07 21:20:35,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {213#true} is VALID [2022-04-07 21:20:35,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#true} [132] L43-->L43-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[] {218#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:35,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#(= main_~p1~0 0)} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {218#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:35,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#(= main_~p1~0 0)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {218#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:35,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#(= main_~p1~0 0)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {218#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:35,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {218#(= main_~p1~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {218#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:35,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#(= main_~p1~0 0)} [141] L59-1-->L66: 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[] {214#false} is VALID [2022-04-07 21:20:35,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {214#false} [143] L66-->L86-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[] {214#false} is VALID [2022-04-07 21:20:35,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {214#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#false} is VALID [2022-04-07 21:20:35,316 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:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:35,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678417667] [2022-04-07 21:20:35,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678417667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:35,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:35,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:35,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413738485] [2022-04-07 21:20:35,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-07 21:20:35,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:35,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:35,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:35,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:35,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:35,329 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,416 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-07 21:20:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-07 21:20:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-07 21:20:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-07 21:20:35,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2022-04-07 21:20:35,475 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:35,476 INFO L225 Difference]: With dead ends: 43 [2022-04-07 21:20:35,476 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 21:20:35,476 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:35,477 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:35,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 21:20:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-07 21:20:35,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:35,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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:35,481 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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:35,482 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,483 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-07 21:20:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-07 21:20:35,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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 43 states. [2022-04-07 21:20:35,484 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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 43 states. [2022-04-07 21:20:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,486 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-07 21:20:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-07 21:20:35,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:35,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-07 21:20:35,488 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-07 21:20:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:35,489 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-07 21:20:35,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states 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:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-07 21:20:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 21:20:35,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:35,489 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:35,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:20:35,490 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1159741911, now seen corresponding path program 1 times [2022-04-07 21:20:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:35,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378343356] [2022-04-07 21:20:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {395#true} is VALID [2022-04-07 21:20:35,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {395#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#true} is VALID [2022-04-07 21:20:35,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {395#true} {395#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#true} is VALID [2022-04-07 21:20:35,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {395#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:35,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {395#true} is VALID [2022-04-07 21:20:35,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {395#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#true} is VALID [2022-04-07 21:20:35,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {395#true} {395#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#true} is VALID [2022-04-07 21:20:35,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {395#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#true} is VALID [2022-04-07 21:20:35,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {395#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {395#true} is VALID [2022-04-07 21:20:35,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {395#true} is VALID [2022-04-07 21:20:35,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {395#true} is VALID [2022-04-07 21:20:35,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#true} [131] L43-->L43-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] {400#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:35,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(not (= main_~p1~0 0))} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {400#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:35,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {400#(not (= main_~p1~0 0))} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {400#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:35,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {400#(not (= main_~p1~0 0))} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {400#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:35,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {400#(not (= main_~p1~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {400#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:35,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {400#(not (= main_~p1~0 0))} [142] L59-1-->L65-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[] {396#false} is VALID [2022-04-07 21:20:35,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {396#false} [145] L65-1-->L71: Formula: (not (= v_main_~p2~0_1 0)) InVars {main_~p2~0=v_main_~p2~0_1} OutVars{main_~p2~0=v_main_~p2~0_1} AuxVars[] AssignedVars[] {396#false} is VALID [2022-04-07 21:20:35,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {396#false} [149] L71-->L86-1: Formula: (not (= v_main_~lk2~0_1 1)) InVars {main_~lk2~0=v_main_~lk2~0_1} OutVars{main_~lk2~0=v_main_~lk2~0_1} AuxVars[] AssignedVars[] {396#false} is VALID [2022-04-07 21:20:35,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {396#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#false} is VALID [2022-04-07 21:20:35,545 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:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:35,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378343356] [2022-04-07 21:20:35,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378343356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:35,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:35,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763573607] [2022-04-07 21:20:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:35,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-07 21:20:35,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:35,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:35,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:35,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:35,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:35,558 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,646 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-07 21:20:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:35,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-07 21:20:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-04-07 21:20:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-04-07 21:20:35,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2022-04-07 21:20:35,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:35,700 INFO L225 Difference]: With dead ends: 46 [2022-04-07 21:20:35,701 INFO L226 Difference]: Without dead ends: 46 [2022-04-07 21:20:35,701 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:35,702 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:35,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-07 21:20:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-07 21:20:35,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:35,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states 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:35,705 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states 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:35,705 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states 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:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,707 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-07 21:20:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-07 21:20:35,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 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 46 states. [2022-04-07 21:20:35,711 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 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 46 states. [2022-04-07 21:20:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,713 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-07 21:20:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-07 21:20:35,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:35,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states 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:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-07 21:20:35,715 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-07 21:20:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:35,715 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-07 21:20:35,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-07 21:20:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 21:20:35,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:35,716 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:35,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:20:35,716 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:35,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:35,717 INFO L85 PathProgramCache]: Analyzing trace with hash -647712552, now seen corresponding path program 1 times [2022-04-07 21:20:35,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:35,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470052893] [2022-04-07 21:20:35,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {589#true} is VALID [2022-04-07 21:20:35,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#true} is VALID [2022-04-07 21:20:35,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#true} is VALID [2022-04-07 21:20:35,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:35,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {589#true} is VALID [2022-04-07 21:20:35,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#true} is VALID [2022-04-07 21:20:35,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#true} is VALID [2022-04-07 21:20:35,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#true} is VALID [2022-04-07 21:20:35,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {589#true} is VALID [2022-04-07 21:20:35,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {589#true} is VALID [2022-04-07 21:20:35,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {589#true} is VALID [2022-04-07 21:20:35,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} [132] L43-->L43-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[] {589#true} is VALID [2022-04-07 21:20:35,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#true} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {594#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(= main_~lk2~0 1)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {594#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(= main_~lk2~0 1)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {594#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(= main_~lk2~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {594#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#(= main_~lk2~0 1)} [142] L59-1-->L65-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[] {594#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#(= main_~lk2~0 1)} [145] L65-1-->L71: Formula: (not (= v_main_~p2~0_1 0)) InVars {main_~p2~0=v_main_~p2~0_1} OutVars{main_~p2~0=v_main_~p2~0_1} AuxVars[] AssignedVars[] {594#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#(= main_~lk2~0 1)} [149] L71-->L86-1: Formula: (not (= v_main_~lk2~0_1 1)) InVars {main_~lk2~0=v_main_~lk2~0_1} OutVars{main_~lk2~0=v_main_~lk2~0_1} AuxVars[] AssignedVars[] {590#false} is VALID [2022-04-07 21:20:35,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {590#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#false} is VALID [2022-04-07 21:20:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:35,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470052893] [2022-04-07 21:20:35,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470052893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:35,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229793942] [2022-04-07 21:20:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-07 21:20:35,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:35,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:35,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:35,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:35,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:35,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:35,814 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,895 INFO L93 Difference]: Finished difference Result 75 states and 118 transitions. [2022-04-07 21:20:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:35,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-07 21:20:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-07 21:20:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-07 21:20:35,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-07 21:20:35,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:35,942 INFO L225 Difference]: With dead ends: 75 [2022-04-07 21:20:35,942 INFO L226 Difference]: Without dead ends: 75 [2022-04-07 21:20:35,942 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:35,949 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:35,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 47 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-07 21:20:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2022-04-07 21:20:35,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:35,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states 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:35,958 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states 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:35,958 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states 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:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,960 INFO L93 Difference]: Finished difference Result 75 states and 118 transitions. [2022-04-07 21:20:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-04-07 21:20:35,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 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 75 states. [2022-04-07 21:20:35,961 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 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 75 states. [2022-04-07 21:20:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,965 INFO L93 Difference]: Finished difference Result 75 states and 118 transitions. [2022-04-07 21:20:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-04-07 21:20:35,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:35,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states 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:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 89 transitions. [2022-04-07 21:20:35,969 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 89 transitions. Word has length 17 [2022-04-07 21:20:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:35,969 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 89 transitions. [2022-04-07 21:20:35,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 89 transitions. [2022-04-07 21:20:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 21:20:35,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:35,971 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:35,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 21:20:35,971 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1095097783, now seen corresponding path program 1 times [2022-04-07 21:20:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:35,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74732672] [2022-04-07 21:20:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {883#true} is VALID [2022-04-07 21:20:36,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {883#true} is VALID [2022-04-07 21:20:36,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {883#true} {883#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {883#true} is VALID [2022-04-07 21:20:36,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {883#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {883#true} is VALID [2022-04-07 21:20:36,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {883#true} is VALID [2022-04-07 21:20:36,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {883#true} {883#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {883#true} is VALID [2022-04-07 21:20:36,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {883#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {883#true} is VALID [2022-04-07 21:20:36,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {883#true} is VALID [2022-04-07 21:20:36,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {883#true} is VALID [2022-04-07 21:20:36,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {883#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {883#true} is VALID [2022-04-07 21:20:36,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#true} [132] L43-->L43-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[] {883#true} is VALID [2022-04-07 21:20:36,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#true} [134] L43-2-->L47-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[] {888#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:36,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {888#(= main_~p2~0 0)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {888#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:36,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {888#(= main_~p2~0 0)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {888#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:36,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {888#(= main_~p2~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {888#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:36,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {888#(= main_~p2~0 0)} [142] L59-1-->L65-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[] {888#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:36,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {888#(= main_~p2~0 0)} [145] L65-1-->L71: Formula: (not (= v_main_~p2~0_1 0)) InVars {main_~p2~0=v_main_~p2~0_1} OutVars{main_~p2~0=v_main_~p2~0_1} AuxVars[] AssignedVars[] {884#false} is VALID [2022-04-07 21:20:36,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#false} [149] L71-->L86-1: Formula: (not (= v_main_~lk2~0_1 1)) InVars {main_~lk2~0=v_main_~lk2~0_1} OutVars{main_~lk2~0=v_main_~lk2~0_1} AuxVars[] AssignedVars[] {884#false} is VALID [2022-04-07 21:20:36,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {884#false} is VALID [2022-04-07 21:20:36,041 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:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74732672] [2022-04-07 21:20:36,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74732672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091029829] [2022-04-07 21:20:36,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-07 21:20:36,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:36,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:36,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,064 INFO L87 Difference]: Start difference. First operand 57 states and 89 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,137 INFO L93 Difference]: Finished difference Result 77 states and 116 transitions. [2022-04-07 21:20:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-07 21:20:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-07 21:20:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-07 21:20:36,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-07 21:20:36,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:36,184 INFO L225 Difference]: With dead ends: 77 [2022-04-07 21:20:36,184 INFO L226 Difference]: Without dead ends: 77 [2022-04-07 21:20:36,184 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:36,186 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:36,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-07 21:20:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-07 21:20:36,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:36,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,195 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,196 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,198 INFO L93 Difference]: Finished difference Result 77 states and 116 transitions. [2022-04-07 21:20:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2022-04-07 21:20:36,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 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 77 states. [2022-04-07 21:20:36,199 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 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 77 states. [2022-04-07 21:20:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,202 INFO L93 Difference]: Finished difference Result 77 states and 116 transitions. [2022-04-07 21:20:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2022-04-07 21:20:36,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:36,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-07 21:20:36,204 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-07 21:20:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:36,204 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-07 21:20:36,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states 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:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-07 21:20:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 21:20:36,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:36,205 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:36,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 21:20:36,205 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:36,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1395779414, now seen corresponding path program 1 times [2022-04-07 21:20:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:36,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040943397] [2022-04-07 21:20:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {1207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {1201#true} is VALID [2022-04-07 21:20:36,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#true} is VALID [2022-04-07 21:20:36,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1201#true} {1201#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#true} is VALID [2022-04-07 21:20:36,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {1201#true} is VALID [2022-04-07 21:20:36,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#true} is VALID [2022-04-07 21:20:36,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#true} is VALID [2022-04-07 21:20:36,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#true} is VALID [2022-04-07 21:20:36,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {1201#true} is VALID [2022-04-07 21:20:36,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {1201#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {1201#true} is VALID [2022-04-07 21:20:36,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1201#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {1201#true} is VALID [2022-04-07 21:20:36,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1201#true} [132] L43-->L43-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[] {1201#true} is VALID [2022-04-07 21:20:36,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {1201#true} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {1206#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:36,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1206#(not (= main_~p2~0 0))} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1206#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:36,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1206#(not (= main_~p2~0 0))} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1206#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:36,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {1206#(not (= main_~p2~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1206#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:36,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {1206#(not (= main_~p2~0 0))} [142] L59-1-->L65-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[] {1206#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:36,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {1206#(not (= main_~p2~0 0))} [146] L65-1-->L70-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[] {1202#false} is VALID [2022-04-07 21:20:36,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1202#false} [151] L70-1-->L76: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1202#false} is VALID [2022-04-07 21:20:36,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {1202#false} [153] L76-->L86-1: Formula: (not (= v_main_~lk3~0_2 1)) InVars {main_~lk3~0=v_main_~lk3~0_2} OutVars{main_~lk3~0=v_main_~lk3~0_2} AuxVars[] AssignedVars[] {1202#false} is VALID [2022-04-07 21:20:36,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1202#false} is VALID [2022-04-07 21:20:36,260 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:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040943397] [2022-04-07 21:20:36,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040943397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116058378] [2022-04-07 21:20:36,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,260 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:36,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,261 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:36,270 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:36,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,271 INFO L87 Difference]: Start difference. First operand 75 states and 115 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:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,341 INFO L93 Difference]: Finished difference Result 79 states and 116 transitions. [2022-04-07 21:20:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:36,341 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:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:36,341 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:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-07 21:20:36,342 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:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-07 21:20:36,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-07 21:20:36,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:36,382 INFO L225 Difference]: With dead ends: 79 [2022-04-07 21:20:36,382 INFO L226 Difference]: Without dead ends: 79 [2022-04-07 21:20:36,382 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:36,383 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 65 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:36,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-07 21:20:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-07 21:20:36,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:36,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,385 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,385 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,387 INFO L93 Difference]: Finished difference Result 79 states and 116 transitions. [2022-04-07 21:20:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2022-04-07 21:20:36,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 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 79 states. [2022-04-07 21:20:36,388 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 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 79 states. [2022-04-07 21:20:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,389 INFO L93 Difference]: Finished difference Result 79 states and 116 transitions. [2022-04-07 21:20:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2022-04-07 21:20:36,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:36,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states 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:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2022-04-07 21:20:36,391 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 18 [2022-04-07 21:20:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:36,391 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2022-04-07 21:20:36,391 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:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2022-04-07 21:20:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 21:20:36,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:36,392 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:36,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 21:20:36,392 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -411675049, now seen corresponding path program 1 times [2022-04-07 21:20:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:36,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726458636] [2022-04-07 21:20:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {1533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {1527#true} is VALID [2022-04-07 21:20:36,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#true} is VALID [2022-04-07 21:20:36,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1527#true} {1527#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#true} is VALID [2022-04-07 21:20:36,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {1527#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {1527#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#true} [132] L43-->L43-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[] {1527#true} is VALID [2022-04-07 21:20:36,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#true} [134] L43-2-->L47-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[] {1527#true} is VALID [2022-04-07 21:20:36,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#true} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1532#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:36,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {1532#(= main_~lk3~0 1)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1532#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:36,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {1532#(= main_~lk3~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1532#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:36,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {1532#(= main_~lk3~0 1)} [142] L59-1-->L65-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[] {1532#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:36,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {1532#(= main_~lk3~0 1)} [146] L65-1-->L70-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[] {1532#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:36,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {1532#(= main_~lk3~0 1)} [151] L70-1-->L76: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1532#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:36,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {1532#(= main_~lk3~0 1)} [153] L76-->L86-1: Formula: (not (= v_main_~lk3~0_2 1)) InVars {main_~lk3~0=v_main_~lk3~0_2} OutVars{main_~lk3~0=v_main_~lk3~0_2} AuxVars[] AssignedVars[] {1528#false} is VALID [2022-04-07 21:20:36,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1528#false} is VALID [2022-04-07 21:20:36,437 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:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726458636] [2022-04-07 21:20:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726458636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404358968] [2022-04-07 21:20:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,437 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:36,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,438 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:36,453 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:36,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,453 INFO L87 Difference]: Start difference. First operand 77 states and 115 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:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,523 INFO L93 Difference]: Finished difference Result 131 states and 196 transitions. [2022-04-07 21:20:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:36,523 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:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:36,523 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:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-07 21:20:36,524 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:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-07 21:20:36,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-07 21:20:36,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:36,562 INFO L225 Difference]: With dead ends: 131 [2022-04-07 21:20:36,562 INFO L226 Difference]: Without dead ends: 131 [2022-04-07 21:20:36,562 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:36,562 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:36,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-07 21:20:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2022-04-07 21:20:36,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:36,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states 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:36,565 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states 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:36,566 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states 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:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,568 INFO L93 Difference]: Finished difference Result 131 states and 196 transitions. [2022-04-07 21:20:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2022-04-07 21:20:36,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 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 131 states. [2022-04-07 21:20:36,569 INFO L87 Difference]: Start difference. First operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 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 131 states. [2022-04-07 21:20:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,572 INFO L93 Difference]: Finished difference Result 131 states and 196 transitions. [2022-04-07 21:20:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2022-04-07 21:20:36,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:36,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states 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:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2022-04-07 21:20:36,574 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 18 [2022-04-07 21:20:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:36,574 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2022-04-07 21:20:36,575 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:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2022-04-07 21:20:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 21:20:36,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:36,575 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:36,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 21:20:36,575 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1331135286, now seen corresponding path program 1 times [2022-04-07 21:20:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:36,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179955935] [2022-04-07 21:20:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {2043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {2037#true} is VALID [2022-04-07 21:20:36,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {2037#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-07 21:20:36,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2037#true} {2037#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-07 21:20:36,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {2037#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2037#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2037#true} {2037#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {2037#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {2037#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {2037#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {2037#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {2037#true} [132] L43-->L43-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[] {2037#true} is VALID [2022-04-07 21:20:36,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {2037#true} [134] L43-2-->L47-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[] {2037#true} is VALID [2022-04-07 21:20:36,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {2037#true} [136] L47-1-->L51-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[] {2042#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {2042#(= main_~p3~0 0)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2042#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {2042#(= main_~p3~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2042#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {2042#(= main_~p3~0 0)} [142] L59-1-->L65-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[] {2042#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(= main_~p3~0 0)} [146] L65-1-->L70-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[] {2042#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(= main_~p3~0 0)} [151] L70-1-->L76: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {2038#false} is VALID [2022-04-07 21:20:36,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {2038#false} [153] L76-->L86-1: Formula: (not (= v_main_~lk3~0_2 1)) InVars {main_~lk3~0=v_main_~lk3~0_2} OutVars{main_~lk3~0=v_main_~lk3~0_2} AuxVars[] AssignedVars[] {2038#false} is VALID [2022-04-07 21:20:36,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {2038#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2038#false} is VALID [2022-04-07 21:20:36,624 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:36,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179955935] [2022-04-07 21:20:36,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179955935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600977214] [2022-04-07 21:20:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,625 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:36,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,626 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:36,635 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:36,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,636 INFO L87 Difference]: Start difference. First operand 105 states and 155 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:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,704 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-04-07 21:20:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:36,704 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:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:36,704 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:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-04-07 21:20:36,705 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:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-04-07 21:20:36,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2022-04-07 21:20:36,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:36,745 INFO L225 Difference]: With dead ends: 139 [2022-04-07 21:20:36,745 INFO L226 Difference]: Without dead ends: 139 [2022-04-07 21:20:36,746 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:36,746 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:36,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-07 21:20:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-04-07 21:20:36,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:36,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,756 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,758 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,761 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-04-07 21:20:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-04-07 21:20:36,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 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 139 states. [2022-04-07 21:20:36,761 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 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 139 states. [2022-04-07 21:20:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,764 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-04-07 21:20:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-04-07 21:20:36,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:36,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 195 transitions. [2022-04-07 21:20:36,767 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 195 transitions. Word has length 18 [2022-04-07 21:20:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:36,768 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 195 transitions. [2022-04-07 21:20:36,768 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:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 195 transitions. [2022-04-07 21:20:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 21:20:36,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:36,768 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:36,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 21:20:36,768 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 123007539, now seen corresponding path program 1 times [2022-04-07 21:20:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:36,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666965311] [2022-04-07 21:20:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {2609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {2603#true} is VALID [2022-04-07 21:20:36,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2603#true} is VALID [2022-04-07 21:20:36,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2603#true} {2603#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2603#true} is VALID [2022-04-07 21:20:36,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {2603#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {2609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {2603#true} is VALID [2022-04-07 21:20:36,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2603#true} is VALID [2022-04-07 21:20:36,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2603#true} {2603#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2603#true} is VALID [2022-04-07 21:20:36,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {2603#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2603#true} is VALID [2022-04-07 21:20:36,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {2603#true} is VALID [2022-04-07 21:20:36,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {2603#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {2603#true} is VALID [2022-04-07 21:20:36,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {2603#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {2603#true} is VALID [2022-04-07 21:20:36,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2603#true} [132] L43-->L43-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[] {2603#true} is VALID [2022-04-07 21:20:36,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2603#true} [134] L43-2-->L47-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[] {2603#true} is VALID [2022-04-07 21:20:36,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {2603#true} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {2608#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2608#(not (= main_~p3~0 0))} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2608#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#(not (= main_~p3~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2608#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(not (= main_~p3~0 0))} [142] L59-1-->L65-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[] {2608#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {2608#(not (= main_~p3~0 0))} [146] L65-1-->L70-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[] {2608#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#(not (= main_~p3~0 0))} [152] L70-1-->L75-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[] {2604#false} is VALID [2022-04-07 21:20:36,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {2604#false} [155] L75-1-->L81: Formula: (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} AuxVars[] AssignedVars[] {2604#false} is VALID [2022-04-07 21:20:36,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {2604#false} [157] L81-->L86-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {2604#false} is VALID [2022-04-07 21:20:36,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {2604#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2604#false} is VALID [2022-04-07 21:20:36,820 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:36,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666965311] [2022-04-07 21:20:36,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666965311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348993174] [2022-04-07 21:20:36,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,821 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:36,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,821 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:36,830 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:36,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,831 INFO L87 Difference]: Start difference. First operand 137 states and 195 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:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,907 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2022-04-07 21:20:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:36,907 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:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:36,907 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:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-07 21:20:36,908 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:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-07 21:20:36,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-07 21:20:36,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:36,951 INFO L225 Difference]: With dead ends: 143 [2022-04-07 21:20:36,951 INFO L226 Difference]: Without dead ends: 143 [2022-04-07 21:20:36,951 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:36,952 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:36,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-07 21:20:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-07 21:20:36,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:36,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,956 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,956 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,958 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2022-04-07 21:20:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2022-04-07 21:20:36,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 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 143 states. [2022-04-07 21:20:36,959 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 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 143 states. [2022-04-07 21:20:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,970 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2022-04-07 21:20:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2022-04-07 21:20:36,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:36,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states 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:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2022-04-07 21:20:36,973 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 19 [2022-04-07 21:20:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:36,974 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2022-04-07 21:20:36,974 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:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2022-04-07 21:20:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 21:20:36,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:36,974 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:36,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 21:20:36,974 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1684446924, now seen corresponding path program 1 times [2022-04-07 21:20:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:36,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548779945] [2022-04-07 21:20:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {3191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {3185#true} is VALID [2022-04-07 21:20:37,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {3185#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3185#true} is VALID [2022-04-07 21:20:37,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3185#true} {3185#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3185#true} is VALID [2022-04-07 21:20:37,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {3185#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:37,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {3191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {3185#true} is VALID [2022-04-07 21:20:37,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {3185#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3185#true} is VALID [2022-04-07 21:20:37,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3185#true} {3185#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3185#true} is VALID [2022-04-07 21:20:37,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {3185#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3185#true} is VALID [2022-04-07 21:20:37,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {3185#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {3185#true} is VALID [2022-04-07 21:20:37,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {3185#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {3185#true} is VALID [2022-04-07 21:20:37,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {3185#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {3185#true} is VALID [2022-04-07 21:20:37,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3185#true} [132] L43-->L43-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[] {3185#true} is VALID [2022-04-07 21:20:37,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {3185#true} [134] L43-2-->L47-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[] {3185#true} is VALID [2022-04-07 21:20:37,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {3185#true} [136] L47-1-->L51-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[] {3185#true} is VALID [2022-04-07 21:20:37,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {3185#true} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3190#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:37,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {3190#(= main_~lk4~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3190#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:37,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {3190#(= main_~lk4~0 1)} [142] L59-1-->L65-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[] {3190#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:37,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(= main_~lk4~0 1)} [146] L65-1-->L70-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[] {3190#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:37,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {3190#(= main_~lk4~0 1)} [152] L70-1-->L75-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[] {3190#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:37,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {3190#(= main_~lk4~0 1)} [155] L75-1-->L81: Formula: (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} AuxVars[] AssignedVars[] {3190#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:37,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {3190#(= main_~lk4~0 1)} [157] L81-->L86-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3186#false} is VALID [2022-04-07 21:20:37,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {3186#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3186#false} is VALID [2022-04-07 21:20:37,004 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:37,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:37,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548779945] [2022-04-07 21:20:37,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548779945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:37,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:37,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453939900] [2022-04-07 21:20:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:37,005 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:37,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:37,005 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:37,014 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:37,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:37,015 INFO L87 Difference]: Start difference. First operand 141 states and 195 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:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,080 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2022-04-07 21:20:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:37,080 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:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-07 21:20:37,081 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:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-07 21:20:37,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-07 21:20:37,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:37,117 INFO L225 Difference]: With dead ends: 235 [2022-04-07 21:20:37,117 INFO L226 Difference]: Without dead ends: 235 [2022-04-07 21:20:37,118 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:37,118 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:37,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:37,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-07 21:20:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-07 21:20:37,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:37,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states 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:37,123 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states 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:37,124 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states 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:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,127 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2022-04-07 21:20:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2022-04-07 21:20:37,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 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 235 states. [2022-04-07 21:20:37,128 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 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 235 states. [2022-04-07 21:20:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,131 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2022-04-07 21:20:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2022-04-07 21:20:37,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:37,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states 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:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 271 transitions. [2022-04-07 21:20:37,134 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 271 transitions. Word has length 19 [2022-04-07 21:20:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:37,134 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 271 transitions. [2022-04-07 21:20:37,134 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:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 271 transitions. [2022-04-07 21:20:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 21:20:37,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:37,135 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:37,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 21:20:37,135 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash 58363411, now seen corresponding path program 1 times [2022-04-07 21:20:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080465829] [2022-04-07 21:20:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {4109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {4103#true} is VALID [2022-04-07 21:20:37,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {4103#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-07 21:20:37,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4103#true} {4103#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-07 21:20:37,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {4103#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:37,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {4109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {4103#true} is VALID [2022-04-07 21:20:37,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {4103#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-07 21:20:37,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4103#true} {4103#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-07 21:20:37,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {4103#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-07 21:20:37,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {4103#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {4103#true} is VALID [2022-04-07 21:20:37,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {4103#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {4103#true} is VALID [2022-04-07 21:20:37,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {4103#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {4103#true} is VALID [2022-04-07 21:20:37,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {4103#true} [132] L43-->L43-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[] {4103#true} is VALID [2022-04-07 21:20:37,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {4103#true} [134] L43-2-->L47-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[] {4103#true} is VALID [2022-04-07 21:20:37,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {4103#true} [136] L47-1-->L51-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[] {4103#true} is VALID [2022-04-07 21:20:37,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {4103#true} [138] L51-1-->L55-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[] {4108#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {4108#(= main_~p4~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {4108#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {4108#(= main_~p4~0 0)} [142] L59-1-->L65-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[] {4108#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {4108#(= main_~p4~0 0)} [146] L65-1-->L70-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[] {4108#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {4108#(= main_~p4~0 0)} [152] L70-1-->L75-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[] {4108#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {4108#(= main_~p4~0 0)} [155] L75-1-->L81: Formula: (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} AuxVars[] AssignedVars[] {4104#false} is VALID [2022-04-07 21:20:37,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {4104#false} [157] L81-->L86-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {4104#false} is VALID [2022-04-07 21:20:37,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {4104#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4104#false} is VALID [2022-04-07 21:20:37,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:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:37,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080465829] [2022-04-07 21:20:37,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080465829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:37,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:37,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506817932] [2022-04-07 21:20:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:37,167 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:37,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:37,168 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:37,177 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:37,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:37,177 INFO L87 Difference]: Start difference. First operand 201 states and 271 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:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,242 INFO L93 Difference]: Finished difference Result 259 states and 328 transitions. [2022-04-07 21:20:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:37,242 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:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:37,242 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:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-07 21:20:37,242 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:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-07 21:20:37,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-07 21:20:37,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:37,283 INFO L225 Difference]: With dead ends: 259 [2022-04-07 21:20:37,283 INFO L226 Difference]: Without dead ends: 259 [2022-04-07 21:20:37,283 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:37,283 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:37,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-07 21:20:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-07 21:20:37,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:37,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,287 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,287 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,290 INFO L93 Difference]: Finished difference Result 259 states and 328 transitions. [2022-04-07 21:20:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 328 transitions. [2022-04-07 21:20:37,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 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 259 states. [2022-04-07 21:20:37,291 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 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 259 states. [2022-04-07 21:20:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,295 INFO L93 Difference]: Finished difference Result 259 states and 328 transitions. [2022-04-07 21:20:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 328 transitions. [2022-04-07 21:20:37,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:37,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 327 transitions. [2022-04-07 21:20:37,298 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 327 transitions. Word has length 19 [2022-04-07 21:20:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:37,299 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 327 transitions. [2022-04-07 21:20:37,299 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:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 327 transitions. [2022-04-07 21:20:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:20:37,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:37,299 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:37,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 21:20:37,299 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -678214798, now seen corresponding path program 1 times [2022-04-07 21:20:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:37,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738767922] [2022-04-07 21:20:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {5155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {5149#true} is VALID [2022-04-07 21:20:37,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {5149#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5149#true} is VALID [2022-04-07 21:20:37,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5149#true} {5149#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5149#true} is VALID [2022-04-07 21:20:37,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {5149#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:37,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {5155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {5149#true} is VALID [2022-04-07 21:20:37,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {5149#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5149#true} is VALID [2022-04-07 21:20:37,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5149#true} {5149#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5149#true} is VALID [2022-04-07 21:20:37,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {5149#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5149#true} is VALID [2022-04-07 21:20:37,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {5149#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {5149#true} is VALID [2022-04-07 21:20:37,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {5149#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {5149#true} is VALID [2022-04-07 21:20:37,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {5149#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {5149#true} is VALID [2022-04-07 21:20:37,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {5149#true} [132] L43-->L43-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[] {5149#true} is VALID [2022-04-07 21:20:37,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {5149#true} [134] L43-2-->L47-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[] {5149#true} is VALID [2022-04-07 21:20:37,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {5149#true} [136] L47-1-->L51-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[] {5149#true} is VALID [2022-04-07 21:20:37,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {5149#true} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {5154#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {5154#(not (= main_~p4~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {5154#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {5154#(not (= main_~p4~0 0))} [142] L59-1-->L65-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[] {5154#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {5154#(not (= main_~p4~0 0))} [146] L65-1-->L70-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[] {5154#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {5154#(not (= main_~p4~0 0))} [152] L70-1-->L75-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[] {5154#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {5154#(not (= main_~p4~0 0))} [156] L75-1-->L80-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[] {5150#false} is VALID [2022-04-07 21:20:37,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {5150#false} [159] L80-1-->L86: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {5150#false} is VALID [2022-04-07 21:20:37,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {5150#false} [161] L86-->L86-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {5150#false} is VALID [2022-04-07 21:20:37,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {5150#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5150#false} is VALID [2022-04-07 21:20:37,344 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:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:37,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738767922] [2022-04-07 21:20:37,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738767922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:37,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:37,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361417531] [2022-04-07 21:20:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:37,344 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:37,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:37,345 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:37,366 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:37,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:37,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:37,367 INFO L87 Difference]: Start difference. First operand 257 states and 327 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:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,463 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2022-04-07 21:20:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:37,463 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:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:37,463 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:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-07 21:20:37,464 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:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-07 21:20:37,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-07 21:20:37,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:37,505 INFO L225 Difference]: With dead ends: 267 [2022-04-07 21:20:37,505 INFO L226 Difference]: Without dead ends: 267 [2022-04-07 21:20:37,505 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:37,506 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:37,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-07 21:20:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-07 21:20:37,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:37,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,510 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,510 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,513 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2022-04-07 21:20:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 328 transitions. [2022-04-07 21:20:37,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 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 267 states. [2022-04-07 21:20:37,514 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 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 267 states. [2022-04-07 21:20:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,518 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2022-04-07 21:20:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 328 transitions. [2022-04-07 21:20:37,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:37,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states 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:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2022-04-07 21:20:37,522 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 20 [2022-04-07 21:20:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:37,522 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2022-04-07 21:20:37,522 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:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2022-04-07 21:20:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:20:37,523 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:37,524 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:37,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 21:20:37,525 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1809298035, now seen corresponding path program 1 times [2022-04-07 21:20:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:37,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189571927] [2022-04-07 21:20:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {6233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {6227#true} is VALID [2022-04-07 21:20:37,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {6227#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6227#true} is VALID [2022-04-07 21:20:37,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6227#true} {6227#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6227#true} is VALID [2022-04-07 21:20:37,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {6227#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:37,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {6233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {6227#true} is VALID [2022-04-07 21:20:37,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {6227#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6227#true} is VALID [2022-04-07 21:20:37,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6227#true} {6227#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6227#true} is VALID [2022-04-07 21:20:37,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {6227#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6227#true} is VALID [2022-04-07 21:20:37,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {6227#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {6227#true} is VALID [2022-04-07 21:20:37,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {6227#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {6227#true} is VALID [2022-04-07 21:20:37,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {6227#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {6227#true} is VALID [2022-04-07 21:20:37,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {6227#true} [132] L43-->L43-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[] {6227#true} is VALID [2022-04-07 21:20:37,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {6227#true} [134] L43-2-->L47-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[] {6227#true} is VALID [2022-04-07 21:20:37,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {6227#true} [136] L47-1-->L51-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[] {6227#true} is VALID [2022-04-07 21:20:37,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {6227#true} [138] L51-1-->L55-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[] {6227#true} is VALID [2022-04-07 21:20:37,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {6227#true} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {6232#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:37,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {6232#(= main_~lk5~0 1)} [142] L59-1-->L65-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[] {6232#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:37,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {6232#(= main_~lk5~0 1)} [146] L65-1-->L70-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[] {6232#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:37,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {6232#(= main_~lk5~0 1)} [152] L70-1-->L75-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[] {6232#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:37,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {6232#(= main_~lk5~0 1)} [156] L75-1-->L80-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[] {6232#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:37,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {6232#(= main_~lk5~0 1)} [159] L80-1-->L86: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {6232#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:37,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {6232#(= main_~lk5~0 1)} [161] L86-->L86-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {6228#false} is VALID [2022-04-07 21:20:37,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {6228#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6228#false} is VALID [2022-04-07 21:20:37,578 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:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:37,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189571927] [2022-04-07 21:20:37,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189571927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:37,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:37,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660591619] [2022-04-07 21:20:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:37,579 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:37,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:37,579 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:37,589 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:37,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:37,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:37,590 INFO L87 Difference]: Start difference. First operand 265 states and 327 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:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,665 INFO L93 Difference]: Finished difference Result 425 states and 503 transitions. [2022-04-07 21:20:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:37,665 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:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:37,665 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:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-04-07 21:20:37,666 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:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-04-07 21:20:37,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2022-04-07 21:20:37,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:37,703 INFO L225 Difference]: With dead ends: 425 [2022-04-07 21:20:37,703 INFO L226 Difference]: Without dead ends: 425 [2022-04-07 21:20:37,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:37,704 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:37,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-07 21:20:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-07 21:20:37,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:37,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states 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:37,710 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states 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:37,710 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states 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:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,717 INFO L93 Difference]: Finished difference Result 425 states and 503 transitions. [2022-04-07 21:20:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 503 transitions. [2022-04-07 21:20:37,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 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 425 states. [2022-04-07 21:20:37,719 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 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 425 states. [2022-04-07 21:20:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,726 INFO L93 Difference]: Finished difference Result 425 states and 503 transitions. [2022-04-07 21:20:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 503 transitions. [2022-04-07 21:20:37,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:37,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states 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:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 471 transitions. [2022-04-07 21:20:37,734 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 471 transitions. Word has length 20 [2022-04-07 21:20:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:37,734 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 471 transitions. [2022-04-07 21:20:37,734 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:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 471 transitions. [2022-04-07 21:20:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:20:37,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:37,737 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:37,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 21:20:37,737 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash -742858926, now seen corresponding path program 1 times [2022-04-07 21:20:37,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:37,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44711443] [2022-04-07 21:20:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:37,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {7913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {7907#true} is VALID [2022-04-07 21:20:37,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {7907#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7907#true} is VALID [2022-04-07 21:20:37,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7907#true} {7907#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7907#true} is VALID [2022-04-07 21:20:37,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {7907#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:37,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {7913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] 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] {7907#true} is VALID [2022-04-07 21:20:37,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {7907#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7907#true} {7907#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {7907#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {7907#true} [122] mainENTRY-->L85-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_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, 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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} 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_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {7907#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {7907#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_5, 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_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {7907#true} [132] L43-->L43-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[] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {7907#true} [134] L43-2-->L47-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[] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {7907#true} [136] L47-1-->L51-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[] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {7907#true} [138] L51-1-->L55-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[] {7907#true} is VALID [2022-04-07 21:20:37,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {7907#true} [140] L55-1-->L59-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[] {7912#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:37,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {7912#(= main_~p5~0 0)} [142] L59-1-->L65-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[] {7912#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:37,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {7912#(= main_~p5~0 0)} [146] L65-1-->L70-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[] {7912#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:37,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {7912#(= main_~p5~0 0)} [152] L70-1-->L75-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[] {7912#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:37,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {7912#(= main_~p5~0 0)} [156] L75-1-->L80-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[] {7912#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:37,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {7912#(= main_~p5~0 0)} [159] L80-1-->L86: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {7908#false} is VALID [2022-04-07 21:20:37,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {7908#false} [161] L86-->L86-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {7908#false} is VALID [2022-04-07 21:20:37,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {7908#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7908#false} is VALID [2022-04-07 21:20:37,780 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:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:37,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44711443] [2022-04-07 21:20:37,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44711443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:37,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928905956] [2022-04-07 21:20:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:37,784 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:37,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:37,784 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:37,794 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:37,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:37,795 INFO L87 Difference]: Start difference. First operand 393 states and 471 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:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,861 INFO L93 Difference]: Finished difference Result 487 states and 534 transitions. [2022-04-07 21:20:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:37,861 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:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:37,862 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:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-07 21:20:37,863 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:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-07 21:20:37,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-07 21:20:37,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:37,898 INFO L225 Difference]: With dead ends: 487 [2022-04-07 21:20:37,898 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 21:20:37,898 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:37,899 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:37,899 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 21:20:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 21:20:37,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:37,900 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:37,900 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:37,900 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:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,900 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:20:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:20:37,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,900 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:37,901 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:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,901 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:20:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:20:37,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:37,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:37,901 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:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 21:20:37,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-07 21:20:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:37,901 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 21:20:37,901 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:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:20:37,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:20:37,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 21:20:37,908 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:37,909 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:20:37,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:37 BasicIcfg [2022-04-07 21:20:37,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:20:37,913 INFO L158 Benchmark]: Toolchain (without parser) took 3815.67ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 162.7MB in the beginning and 158.5MB in the end (delta: 4.2MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2022-04-07 21:20:37,913 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 151.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:20:37,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.12ms. Allocated memory is still 191.9MB. Free memory was 162.7MB in the beginning and 161.9MB in the end (delta: 828.7kB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-07 21:20:37,914 INFO L158 Benchmark]: Boogie Preprocessor took 26.57ms. Allocated memory is still 191.9MB. Free memory was 161.9MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:37,914 INFO L158 Benchmark]: RCFGBuilder took 223.33ms. Allocated memory is still 191.9MB. Free memory was 160.2MB in the beginning and 148.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 21:20:37,914 INFO L158 Benchmark]: IcfgTransformer took 23.51ms. Allocated memory is still 191.9MB. Free memory was 148.7MB in the beginning and 146.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:37,914 INFO L158 Benchmark]: TraceAbstraction took 3328.30ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 146.2MB in the beginning and 158.5MB in the end (delta: -12.3MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. [2022-04-07 21:20:37,915 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.10ms. Allocated memory is still 191.9MB. Free memory is still 151.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.12ms. Allocated memory is still 191.9MB. Free memory was 162.7MB in the beginning and 161.9MB in the end (delta: 828.7kB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.57ms. Allocated memory is still 191.9MB. Free memory was 161.9MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 223.33ms. Allocated memory is still 191.9MB. Free memory was 160.2MB in the beginning and 148.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 23.51ms. Allocated memory is still 191.9MB. Free memory was 148.7MB in the beginning and 146.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3328.30ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 146.2MB in the beginning and 158.5MB in the end (delta: -12.3MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 910 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 910 mSDsluCounter, 768 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 668 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:37,951 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...