/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:10:20,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:10:20,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:10:20,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:10:20,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:10:20,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:10:20,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:10:20,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:10:20,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:10:20,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:10:20,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:10:20,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:10:20,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:10:20,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:10:20,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:10:20,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:10:20,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:10:20,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:10:20,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:10:20,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:10:20,090 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:10:20,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:10:20,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:10:20,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:10:20,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:10:20,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:10:20,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:10:20,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:10:20,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:10:20,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:10:20,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:10:20,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:10:20,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:10:20,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:10:20,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:10:20,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:10:20,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:10:20,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:10:20,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:10:20,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:10:20,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:10:20,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:10:20,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:10:20,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:10:20,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:10:20,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:10:20,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:10:20,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:10:20,118 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:10:20,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:10:20,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:10:20,119 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:10:20,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:10:20,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:10:20,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:20,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:10:20,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:10:20,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 15:10:20,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:10:20,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:10:20,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:10:20,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:10:20,329 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:10:20,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-04-27 15:10:20,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f79a37c8/1370f8472b39446f96fa8659cdafe7e6/FLAG7a170adda [2022-04-27 15:10:20,696 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:10:20,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-04-27 15:10:20,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f79a37c8/1370f8472b39446f96fa8659cdafe7e6/FLAG7a170adda [2022-04-27 15:10:21,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f79a37c8/1370f8472b39446f96fa8659cdafe7e6 [2022-04-27 15:10:21,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:10:21,139 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:10:21,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:21,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:10:21,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:10:21,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9e5fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21, skipping insertion in model container [2022-04-27 15:10:21,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:10:21,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:10:21,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2022-04-27 15:10:21,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:21,342 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:10:21,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2022-04-27 15:10:21,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:21,368 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:10:21,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21 WrapperNode [2022-04-27 15:10:21,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:21,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:10:21,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:10:21,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:10:21,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:10:21,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:10:21,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:10:21,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:10:21,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (1/1) ... [2022-04-27 15:10:21,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:10:21,411 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-27 15:10:21,412 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-27 15:10:21,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:10:21,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:10:21,454 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:10:21,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:10:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:10:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:10:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:10:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:10:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:10:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:10:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:10:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:10:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:10:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:10:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:10:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:10:21,495 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:10:21,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:10:21,619 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:10:21,624 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:10:21,624 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:10:21,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:21 BoogieIcfgContainer [2022-04-27 15:10:21,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:10:21,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:10:21,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:10:21,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:10:21,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:10:21" (1/3) ... [2022-04-27 15:10:21,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2018eddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:21, skipping insertion in model container [2022-04-27 15:10:21,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:21" (2/3) ... [2022-04-27 15:10:21,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2018eddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:21, skipping insertion in model container [2022-04-27 15:10:21,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:21" (3/3) ... [2022-04-27 15:10:21,630 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-04-27 15:10:21,639 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:10:21,639 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:10:21,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:10:21,686 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9566da0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11a5009d [2022-04-27 15:10:21,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:10:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:10:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:10:21,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:21,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:21,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-04-27 15:10:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:21,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417331060] [2022-04-27 15:10:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:21,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-27 15:10:21,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 15:10:21,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-27 15:10:21,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:21,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-27 15:10:21,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 15:10:21,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-27 15:10:21,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret12 := main(); {39#true} is VALID [2022-04-27 15:10:21,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {39#true} is VALID [2022-04-27 15:10:21,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {39#true} is VALID [2022-04-27 15:10:21,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {39#true} is VALID [2022-04-27 15:10:21,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 != ~p1~0;~lk1~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p1~0; {44#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:21,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {40#false} is VALID [2022-04-27 15:10:21,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-27 15:10:21,875 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-27 15:10:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:21,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417331060] [2022-04-27 15:10:21,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417331060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:21,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:21,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858705078] [2022-04-27 15:10:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:21,882 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-27 15:10:21,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:21,885 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-27 15:10:21,902 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-27 15:10:21,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:21,928 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,180 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-27 15:10:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:22,181 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-27 15:10:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:22,182 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-27 15:10:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:10:22,190 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-27 15:10:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:10:22,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-27 15:10:22,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:22,288 INFO L225 Difference]: With dead ends: 70 [2022-04-27 15:10:22,289 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 15:10:22,290 INFO L412 NwaCegarLoop]: 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-27 15:10:22,293 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:22,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 15:10:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-04-27 15:10:22,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:22,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,319 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,319 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,323 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-27 15:10:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-27 15:10:22,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:22,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:22,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 15:10:22,324 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 15:10:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,341 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-27 15:10:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-27 15:10:22,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:22,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:22,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:22,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-04-27 15:10:22,350 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-04-27 15:10:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:22,350 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-04-27 15:10:22,351 INFO L496 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-27 15:10:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-04-27 15:10:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:10:22,351 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:22,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:22,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:10:22,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-04-27 15:10:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:22,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433860485] [2022-04-27 15:10:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:22,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {288#true} is VALID [2022-04-27 15:10:22,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-27 15:10:22,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} #149#return; {288#true} is VALID [2022-04-27 15:10:22,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:22,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {288#true} is VALID [2022-04-27 15:10:22,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-27 15:10:22,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #149#return; {288#true} is VALID [2022-04-27 15:10:22,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret12 := main(); {288#true} is VALID [2022-04-27 15:10:22,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {288#true} is VALID [2022-04-27 15:10:22,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {288#true} is VALID [2022-04-27 15:10:22,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {288#true} is VALID [2022-04-27 15:10:22,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#true} assume !(0 != ~p1~0); {293#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:22,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(= main_~p1~0 0)} assume !(0 != ~p2~0); {293#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:22,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {293#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:22,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {293#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:22,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {293#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:22,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {293#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:22,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {293#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:22,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {293#(= main_~p1~0 0)} assume 0 != ~p1~0; {289#false} is VALID [2022-04-27 15:10:22,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#false} assume 1 != ~lk1~0; {289#false} is VALID [2022-04-27 15:10:22,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-27 15:10:22,431 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-27 15:10:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:22,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433860485] [2022-04-27 15:10:22,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433860485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:22,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:22,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839495559] [2022-04-27 15:10:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:22,433 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-27 15:10:22,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:22,433 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-27 15:10:22,445 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-27 15:10:22,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:22,446 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,565 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-27 15:10:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:22,566 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-27 15:10:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:22,566 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-27 15:10:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 15:10:22,568 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-27 15:10:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 15:10:22,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-27 15:10:22,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:22,667 INFO L225 Difference]: With dead ends: 88 [2022-04-27 15:10:22,667 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 15:10:22,667 INFO L412 NwaCegarLoop]: 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-27 15:10:22,668 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:22,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 15:10:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-27 15:10:22,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:22,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,674 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,674 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,676 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-27 15:10:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-27 15:10:22,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:22,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:22,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 15:10:22,677 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 15:10:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,679 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-27 15:10:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-27 15:10:22,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:22,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:22,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:22,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-04-27 15:10:22,682 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-04-27 15:10:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:22,682 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-04-27 15:10:22,682 INFO L496 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-27 15:10:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-04-27 15:10:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:22,683 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:22,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:22,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:10:22,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-04-27 15:10:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:22,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162380521] [2022-04-27 15:10:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:22,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {568#true} is VALID [2022-04-27 15:10:22,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-27 15:10:22,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #149#return; {568#true} is VALID [2022-04-27 15:10:22,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:22,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {568#true} is VALID [2022-04-27 15:10:22,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-27 15:10:22,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} #149#return; {568#true} is VALID [2022-04-27 15:10:22,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {568#true} call #t~ret12 := main(); {568#true} is VALID [2022-04-27 15:10:22,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {568#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {568#true} is VALID [2022-04-27 15:10:22,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {568#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {568#true} is VALID [2022-04-27 15:10:22,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {568#true} is VALID [2022-04-27 15:10:22,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#true} assume 0 != ~p1~0;~lk1~0 := 1; {573#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:22,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {573#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:22,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {573#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:22,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {573#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:22,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {573#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {573#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:22,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {573#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {573#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:22,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {573#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {573#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:22,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {573#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {569#false} is VALID [2022-04-27 15:10:22,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#false} assume 0 != ~p2~0; {569#false} is VALID [2022-04-27 15:10:22,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} assume 1 != ~lk2~0; {569#false} is VALID [2022-04-27 15:10:22,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-27 15:10:22,735 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-27 15:10:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162380521] [2022-04-27 15:10:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162380521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:22,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:22,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016609687] [2022-04-27 15:10:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:22,736 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-27 15:10:22,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:22,736 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-27 15:10:22,750 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-27 15:10:22,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:22,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:22,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:22,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:22,751 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,857 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-04-27 15:10:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:22,858 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-27 15:10:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:22,858 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-27 15:10:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-27 15:10:22,860 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-27 15:10:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-27 15:10:22,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-27 15:10:22,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:22,949 INFO L225 Difference]: With dead ends: 82 [2022-04-27 15:10:22,949 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 15:10:22,949 INFO L412 NwaCegarLoop]: 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-27 15:10:22,950 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:22,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 15:10:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-27 15:10:22,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:22,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,955 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,955 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,957 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-27 15:10:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-27 15:10:22,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:22,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:22,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 15:10:22,957 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-27 15:10:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:22,959 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-27 15:10:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-27 15:10:22,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:22,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:22,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:22,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-04-27 15:10:22,961 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-04-27 15:10:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:22,961 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-04-27 15:10:22,961 INFO L496 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-27 15:10:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-04-27 15:10:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:22,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:22,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:22,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:10:22,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-04-27 15:10:22,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:22,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537845038] [2022-04-27 15:10:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {853#true} is VALID [2022-04-27 15:10:22,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-27 15:10:22,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {853#true} {853#true} #149#return; {853#true} is VALID [2022-04-27 15:10:22,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:22,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {853#true} is VALID [2022-04-27 15:10:22,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-27 15:10:22,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #149#return; {853#true} is VALID [2022-04-27 15:10:22,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret12 := main(); {853#true} is VALID [2022-04-27 15:10:22,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {853#true} is VALID [2022-04-27 15:10:23,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {853#true} is VALID [2022-04-27 15:10:23,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {853#true} is VALID [2022-04-27 15:10:23,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !(0 != ~p1~0); {853#true} is VALID [2022-04-27 15:10:23,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume !(0 != ~p2~0); {858#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:23,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {858#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:23,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {858#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:23,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {858#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:23,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {858#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {858#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:23,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {858#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {858#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:23,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {858#(= main_~p2~0 0)} assume !(0 != ~p1~0); {858#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:23,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {858#(= main_~p2~0 0)} assume 0 != ~p2~0; {854#false} is VALID [2022-04-27 15:10:23,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {854#false} assume 1 != ~lk2~0; {854#false} is VALID [2022-04-27 15:10:23,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-27 15:10:23,003 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-27 15:10:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:23,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537845038] [2022-04-27 15:10:23,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537845038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:23,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:23,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739324929] [2022-04-27 15:10:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:23,004 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-27 15:10:23,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:23,004 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-27 15:10:23,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-27 15:10:23,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:23,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:23,015 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,124 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-04-27 15:10:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:23,125 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-27 15:10:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:23,125 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-27 15:10:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 15:10:23,127 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-27 15:10:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 15:10:23,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-27 15:10:23,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:23,242 INFO L225 Difference]: With dead ends: 148 [2022-04-27 15:10:23,242 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 15:10:23,243 INFO L412 NwaCegarLoop]: 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-27 15:10:23,244 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:23,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 15:10:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-27 15:10:23,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:23,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,249 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,250 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,252 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-27 15:10:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-27 15:10:23,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-27 15:10:23,253 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-27 15:10:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,255 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-27 15:10:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-27 15:10:23,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:23,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-04-27 15:10:23,259 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-04-27 15:10:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:23,259 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-04-27 15:10:23,259 INFO L496 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-27 15:10:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-04-27 15:10:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:23,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:23,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:23,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:10:23,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-04-27 15:10:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444510221] [2022-04-27 15:10:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1338#true} is VALID [2022-04-27 15:10:23,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1338#true} assume true; {1338#true} is VALID [2022-04-27 15:10:23,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1338#true} {1338#true} #149#return; {1338#true} is VALID [2022-04-27 15:10:23,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {1338#true} call ULTIMATE.init(); {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:23,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1338#true} is VALID [2022-04-27 15:10:23,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {1338#true} assume true; {1338#true} is VALID [2022-04-27 15:10:23,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1338#true} {1338#true} #149#return; {1338#true} is VALID [2022-04-27 15:10:23,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {1338#true} call #t~ret12 := main(); {1338#true} is VALID [2022-04-27 15:10:23,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {1338#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1338#true} is VALID [2022-04-27 15:10:23,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {1338#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1338#true} is VALID [2022-04-27 15:10:23,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1338#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1338#true} is VALID [2022-04-27 15:10:23,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1338#true} assume !(0 != ~p1~0); {1338#true} is VALID [2022-04-27 15:10:23,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1338#true} assume 0 != ~p2~0;~lk2~0 := 1; {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {1343#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1343#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {1343#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1343#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:23,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {1343#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1339#false} is VALID [2022-04-27 15:10:23,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {1339#false} assume !false; {1339#false} is VALID [2022-04-27 15:10:23,297 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-27 15:10:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:23,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444510221] [2022-04-27 15:10:23,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444510221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:23,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:23,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652236863] [2022-04-27 15:10:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:23,298 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-27 15:10:23,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:23,298 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-27 15:10:23,308 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-27 15:10:23,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:23,309 INFO L87 Difference]: Start difference. First operand 99 states and 165 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-27 15:10:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,415 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-04-27 15:10:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:23,415 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-27 15:10:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:23,415 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-27 15:10:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-27 15:10:23,416 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-27 15:10:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-27 15:10:23,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-27 15:10:23,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:23,496 INFO L225 Difference]: With dead ends: 127 [2022-04-27 15:10:23,496 INFO L226 Difference]: Without dead ends: 125 [2022-04-27 15:10:23,496 INFO L412 NwaCegarLoop]: 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-27 15:10:23,497 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:23,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-27 15:10:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-04-27 15:10:23,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:23,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,502 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,503 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,505 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-27 15:10:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-27 15:10:23,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-27 15:10:23,506 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-27 15:10:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,509 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-27 15:10:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-27 15:10:23,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:23,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-04-27 15:10:23,512 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-04-27 15:10:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:23,512 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-04-27 15:10:23,512 INFO L496 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-27 15:10:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-04-27 15:10:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:23,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:23,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:23,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:10:23,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-04-27 15:10:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:23,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065436828] [2022-04-27 15:10:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1850#true} is VALID [2022-04-27 15:10:23,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-27 15:10:23,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1850#true} {1850#true} #149#return; {1850#true} is VALID [2022-04-27 15:10:23,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:23,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #149#return; {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {1850#true} call #t~ret12 := main(); {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {1850#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {1850#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {1850#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {1850#true} assume !(0 != ~p1~0); {1850#true} is VALID [2022-04-27 15:10:23,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#true} assume !(0 != ~p2~0); {1850#true} is VALID [2022-04-27 15:10:23,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {1850#true} assume 0 != ~p3~0;~lk3~0 := 1; {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {1855#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {1855#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {1855#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {1855#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {1855#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {1855#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {1855#(= main_~lk3~0 1)} assume 0 != ~p3~0; {1855#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:23,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {1855#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {1851#false} is VALID [2022-04-27 15:10:23,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-04-27 15:10:23,547 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-27 15:10:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:23,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065436828] [2022-04-27 15:10:23,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065436828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:23,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:23,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:23,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69024417] [2022-04-27 15:10:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:23,548 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-27 15:10:23,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:23,548 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-27 15:10:23,559 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-27 15:10:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:23,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:23,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:23,560 INFO L87 Difference]: Start difference. First operand 99 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,667 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-04-27 15:10:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:23,667 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-27 15:10:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:23,667 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-27 15:10:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 15:10:23,668 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-27 15:10:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 15:10:23,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-27 15:10:23,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:23,733 INFO L225 Difference]: With dead ends: 179 [2022-04-27 15:10:23,733 INFO L226 Difference]: Without dead ends: 177 [2022-04-27 15:10:23,734 INFO L412 NwaCegarLoop]: 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-27 15:10:23,734 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:23,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-27 15:10:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-04-27 15:10:23,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:23,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,740 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,740 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,744 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-27 15:10:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-27 15:10:23,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 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 177 states. [2022-04-27 15:10:23,745 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 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 177 states. [2022-04-27 15:10:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,749 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-27 15:10:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-27 15:10:23,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:23,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-04-27 15:10:23,752 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-04-27 15:10:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:23,753 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-04-27 15:10:23,753 INFO L496 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-27 15:10:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-04-27 15:10:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:23,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:23,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:23,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:10:23,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:23,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-04-27 15:10:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:23,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872160892] [2022-04-27 15:10:23,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:23,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {2562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2556#true} is VALID [2022-04-27 15:10:23,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2556#true} assume true; {2556#true} is VALID [2022-04-27 15:10:23,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2556#true} {2556#true} #149#return; {2556#true} is VALID [2022-04-27 15:10:23,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {2556#true} call ULTIMATE.init(); {2562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:23,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2556#true} assume true; {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2556#true} {2556#true} #149#return; {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {2556#true} call #t~ret12 := main(); {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {2556#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {2556#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {2556#true} assume !(0 != ~p1~0); {2556#true} is VALID [2022-04-27 15:10:23,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {2556#true} assume !(0 != ~p2~0); {2556#true} is VALID [2022-04-27 15:10:23,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {2556#true} assume !(0 != ~p3~0); {2561#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:23,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {2561#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2561#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:23,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {2561#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2561#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:23,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {2561#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2561#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:23,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {2561#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2561#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:23,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {2561#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2561#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:23,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {2561#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2561#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:23,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {2561#(= main_~p3~0 0)} assume 0 != ~p3~0; {2557#false} is VALID [2022-04-27 15:10:23,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {2557#false} assume 1 != ~lk3~0; {2557#false} is VALID [2022-04-27 15:10:23,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {2557#false} assume !false; {2557#false} is VALID [2022-04-27 15:10:23,786 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-27 15:10:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872160892] [2022-04-27 15:10:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872160892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:23,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119843806] [2022-04-27 15:10:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:23,787 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-27 15:10:23,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:23,787 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-27 15:10:23,797 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-27 15:10:23,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:23,798 INFO L87 Difference]: Start difference. First operand 135 states and 221 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-27 15:10:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,907 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-04-27 15:10:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:23,908 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-27 15:10:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:23,908 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-27 15:10:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-27 15:10:23,909 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-27 15:10:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-27 15:10:23,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-27 15:10:23,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:23,997 INFO L225 Difference]: With dead ends: 311 [2022-04-27 15:10:23,997 INFO L226 Difference]: Without dead ends: 185 [2022-04-27 15:10:23,998 INFO L412 NwaCegarLoop]: 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-27 15:10:23,998 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:23,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-27 15:10:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-27 15:10:24,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:24,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,005 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,005 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,008 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-27 15:10:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-27 15:10:24,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 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 185 states. [2022-04-27 15:10:24,009 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 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 185 states. [2022-04-27 15:10:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,012 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-27 15:10:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-27 15:10:24,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:24,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-04-27 15:10:24,017 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-04-27 15:10:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:24,017 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-04-27 15:10:24,017 INFO L496 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-27 15:10:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-04-27 15:10:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:24,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:24,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:24,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:10:24,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-04-27 15:10:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:24,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915265020] [2022-04-27 15:10:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {3472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3466#true} is VALID [2022-04-27 15:10:24,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {3466#true} assume true; {3466#true} is VALID [2022-04-27 15:10:24,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3466#true} {3466#true} #149#return; {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {3466#true} call ULTIMATE.init(); {3472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:24,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {3472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {3466#true} assume true; {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3466#true} {3466#true} #149#return; {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {3466#true} call #t~ret12 := main(); {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {3466#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {3466#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {3466#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {3466#true} is VALID [2022-04-27 15:10:24,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#true} assume !(0 != ~p1~0); {3466#true} is VALID [2022-04-27 15:10:24,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {3466#true} assume !(0 != ~p2~0); {3466#true} is VALID [2022-04-27 15:10:24,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {3466#true} assume 0 != ~p3~0;~lk3~0 := 1; {3471#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:24,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {3471#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3471#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:24,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {3471#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3471#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:24,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {3471#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:24,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {3471#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {3471#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:24,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {3471#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3471#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:24,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {3471#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3471#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:24,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {3471#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3467#false} is VALID [2022-04-27 15:10:24,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {3467#false} assume 0 != ~p4~0; {3467#false} is VALID [2022-04-27 15:10:24,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {3467#false} assume 1 != ~lk4~0; {3467#false} is VALID [2022-04-27 15:10:24,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {3467#false} assume !false; {3467#false} is VALID [2022-04-27 15:10:24,049 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-27 15:10:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:24,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915265020] [2022-04-27 15:10:24,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915265020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:24,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:24,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079847955] [2022-04-27 15:10:24,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:24,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:24,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:24,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:24,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:24,062 INFO L87 Difference]: Start difference. First operand 183 states and 295 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,172 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-04-27 15:10:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:10:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:10:24,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-27 15:10:24,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,260 INFO L225 Difference]: With dead ends: 277 [2022-04-27 15:10:24,260 INFO L226 Difference]: Without dead ends: 191 [2022-04-27 15:10:24,261 INFO L412 NwaCegarLoop]: 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-27 15:10:24,261 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:24,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-27 15:10:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-04-27 15:10:24,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:24,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,267 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,267 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,271 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-27 15:10:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-27 15:10:24,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-27 15:10:24,272 INFO L87 Difference]: Start difference. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-27 15:10:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,275 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-27 15:10:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-27 15:10:24,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:24,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-04-27 15:10:24,279 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-04-27 15:10:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:24,279 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-04-27 15:10:24,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-04-27 15:10:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:24,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:24,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:24,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:10:24,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-04-27 15:10:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:24,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993373225] [2022-04-27 15:10:24,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:24,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {4366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4360#true} is VALID [2022-04-27 15:10:24,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {4360#true} assume true; {4360#true} is VALID [2022-04-27 15:10:24,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4360#true} {4360#true} #149#return; {4360#true} is VALID [2022-04-27 15:10:24,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {4360#true} call ULTIMATE.init(); {4366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {4366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {4360#true} assume true; {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4360#true} {4360#true} #149#return; {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {4360#true} call #t~ret12 := main(); {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {4360#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {4360#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {4360#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {4360#true} assume !(0 != ~p1~0); {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {4360#true} assume !(0 != ~p2~0); {4360#true} is VALID [2022-04-27 15:10:24,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {4360#true} assume !(0 != ~p3~0); {4360#true} is VALID [2022-04-27 15:10:24,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {4360#true} assume 0 != ~p4~0;~lk4~0 := 1; {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {4365#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {4365#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {4365#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {4365#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {4365#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {4365#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {4365#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4365#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:24,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {4365#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4361#false} is VALID [2022-04-27 15:10:24,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {4361#false} assume !false; {4361#false} is VALID [2022-04-27 15:10:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:24,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:24,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993373225] [2022-04-27 15:10:24,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993373225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:24,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:24,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071148261] [2022-04-27 15:10:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:24,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:24,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:24,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:24,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:24,322 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,444 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-04-27 15:10:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-27 15:10:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-27 15:10:24,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-27 15:10:24,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,507 INFO L225 Difference]: With dead ends: 333 [2022-04-27 15:10:24,507 INFO L226 Difference]: Without dead ends: 331 [2022-04-27 15:10:24,507 INFO L412 NwaCegarLoop]: 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-27 15:10:24,508 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:24,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-27 15:10:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-04-27 15:10:24,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:24,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,514 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,514 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,520 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-27 15:10:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-27 15:10:24,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-27 15:10:24,521 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-27 15:10:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,526 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-27 15:10:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-27 15:10:24,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:24,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-04-27 15:10:24,530 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-04-27 15:10:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:24,530 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-04-27 15:10:24,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-04-27 15:10:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:24,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:24,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:10:24,531 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-04-27 15:10:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:24,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215788358] [2022-04-27 15:10:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {5676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5670#true} is VALID [2022-04-27 15:10:24,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {5670#true} assume true; {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5670#true} {5670#true} #149#return; {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {5670#true} call ULTIMATE.init(); {5676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:24,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {5676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {5670#true} assume true; {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5670#true} {5670#true} #149#return; {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {5670#true} call #t~ret12 := main(); {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {5670#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {5670#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {5670#true} is VALID [2022-04-27 15:10:24,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {5670#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {5670#true} is VALID [2022-04-27 15:10:24,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {5670#true} assume !(0 != ~p1~0); {5670#true} is VALID [2022-04-27 15:10:24,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {5670#true} assume !(0 != ~p2~0); {5670#true} is VALID [2022-04-27 15:10:24,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {5670#true} assume !(0 != ~p3~0); {5670#true} is VALID [2022-04-27 15:10:24,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {5670#true} assume !(0 != ~p4~0); {5675#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:24,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {5675#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5675#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:24,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {5675#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5675#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:24,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {5675#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5675#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:24,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#(= main_~p4~0 0)} assume !(0 != ~p1~0); {5675#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:24,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {5675#(= main_~p4~0 0)} assume !(0 != ~p2~0); {5675#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:24,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {5675#(= main_~p4~0 0)} assume !(0 != ~p3~0); {5675#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:24,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {5675#(= main_~p4~0 0)} assume 0 != ~p4~0; {5671#false} is VALID [2022-04-27 15:10:24,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {5671#false} assume 1 != ~lk4~0; {5671#false} is VALID [2022-04-27 15:10:24,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {5671#false} assume !false; {5671#false} is VALID [2022-04-27 15:10:24,558 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-27 15:10:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:24,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215788358] [2022-04-27 15:10:24,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215788358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:24,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:24,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136892038] [2022-04-27 15:10:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:24,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:24,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:24,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:24,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:24,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:24,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:24,570 INFO L87 Difference]: Start difference. First operand 265 states and 411 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,684 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-04-27 15:10:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-27 15:10:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-27 15:10:24,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-27 15:10:24,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,774 INFO L225 Difference]: With dead ends: 605 [2022-04-27 15:10:24,774 INFO L226 Difference]: Without dead ends: 355 [2022-04-27 15:10:24,775 INFO L412 NwaCegarLoop]: 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-27 15:10:24,776 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:24,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-27 15:10:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-04-27 15:10:24,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:24,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,782 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,782 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,787 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-27 15:10:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-27 15:10:24,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-27 15:10:24,789 INFO L87 Difference]: Start difference. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-27 15:10:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,794 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-27 15:10:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-27 15:10:24,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:24,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-04-27 15:10:24,800 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-04-27 15:10:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:24,800 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-04-27 15:10:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-04-27 15:10:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:24,800 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:24,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:24,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:10:24,801 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-04-27 15:10:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:24,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683505096] [2022-04-27 15:10:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7404#true} is VALID [2022-04-27 15:10:24,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-04-27 15:10:24,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7404#true} {7404#true} #149#return; {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {7404#true} call ULTIMATE.init(); {7410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:24,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {7404#true} assume true; {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7404#true} {7404#true} #149#return; {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {7404#true} call #t~ret12 := main(); {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {7404#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {7404#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {7404#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {7404#true} is VALID [2022-04-27 15:10:24,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {7404#true} assume !(0 != ~p1~0); {7404#true} is VALID [2022-04-27 15:10:24,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {7404#true} assume !(0 != ~p2~0); {7404#true} is VALID [2022-04-27 15:10:24,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {7404#true} assume !(0 != ~p3~0); {7404#true} is VALID [2022-04-27 15:10:24,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {7404#true} assume 0 != ~p4~0;~lk4~0 := 1; {7409#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:24,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {7409#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7409#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:24,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {7409#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7409#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:24,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {7409#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7409#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:24,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {7409#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {7409#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:24,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {7409#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {7409#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:24,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {7409#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {7409#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:24,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {7405#false} is VALID [2022-04-27 15:10:24,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {7405#false} assume 0 != ~p5~0; {7405#false} is VALID [2022-04-27 15:10:24,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {7405#false} assume 1 != ~lk5~0; {7405#false} is VALID [2022-04-27 15:10:24,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {7405#false} assume !false; {7405#false} is VALID [2022-04-27 15:10:24,828 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-27 15:10:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:24,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683505096] [2022-04-27 15:10:24,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683505096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:24,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:24,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944419218] [2022-04-27 15:10:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:24,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:24,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:24,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:24,841 INFO L87 Difference]: Start difference. First operand 353 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,951 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-04-27 15:10:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-27 15:10:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-27 15:10:24,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-27 15:10:25,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,041 INFO L225 Difference]: With dead ends: 529 [2022-04-27 15:10:25,041 INFO L226 Difference]: Without dead ends: 363 [2022-04-27 15:10:25,041 INFO L412 NwaCegarLoop]: 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-27 15:10:25,041 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-27 15:10:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-04-27 15:10:25,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,048 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,048 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,054 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-27 15:10:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-27 15:10:25,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-27 15:10:25,055 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-27 15:10:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,060 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-27 15:10:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-27 15:10:25,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-04-27 15:10:25,067 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-04-27 15:10:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,067 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-04-27 15:10:25,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-04-27 15:10:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:25,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:25,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:10:25,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-04-27 15:10:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646346197] [2022-04-27 15:10:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {9092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9086#true} is VALID [2022-04-27 15:10:25,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {9086#true} assume true; {9086#true} is VALID [2022-04-27 15:10:25,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9086#true} {9086#true} #149#return; {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {9086#true} call ULTIMATE.init(); {9092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {9092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {9086#true} assume true; {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9086#true} {9086#true} #149#return; {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {9086#true} call #t~ret12 := main(); {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {9086#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {9086#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {9086#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {9086#true} assume !(0 != ~p1~0); {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {9086#true} assume !(0 != ~p2~0); {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {9086#true} assume !(0 != ~p3~0); {9086#true} is VALID [2022-04-27 15:10:25,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {9086#true} assume !(0 != ~p4~0); {9086#true} is VALID [2022-04-27 15:10:25,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {9086#true} assume 0 != ~p5~0;~lk5~0 := 1; {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {9091#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {9091#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {9091#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {9091#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {9091#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {9091#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {9091#(= main_~lk5~0 1)} assume 0 != ~p5~0; {9091#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:25,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {9091#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {9087#false} is VALID [2022-04-27 15:10:25,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {9087#false} assume !false; {9087#false} is VALID [2022-04-27 15:10:25,097 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-27 15:10:25,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646346197] [2022-04-27 15:10:25,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646346197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217646953] [2022-04-27 15:10:25,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:25,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,120 INFO L87 Difference]: Start difference. First operand 361 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,233 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-04-27 15:10:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-27 15:10:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-27 15:10:25,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-27 15:10:25,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,308 INFO L225 Difference]: With dead ends: 621 [2022-04-27 15:10:25,308 INFO L226 Difference]: Without dead ends: 619 [2022-04-27 15:10:25,309 INFO L412 NwaCegarLoop]: 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-27 15:10:25,309 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-27 15:10:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-04-27 15:10:25,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,318 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,318 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,330 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-27 15:10:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-27 15:10:25,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-27 15:10:25,337 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-27 15:10:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,350 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-27 15:10:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-27 15:10:25,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-04-27 15:10:25,360 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-04-27 15:10:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,360 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-04-27 15:10:25,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-04-27 15:10:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:25,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:25,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:10:25,363 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-04-27 15:10:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463548723] [2022-04-27 15:10:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {11546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11540#true} is VALID [2022-04-27 15:10:25,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {11540#true} assume true; {11540#true} is VALID [2022-04-27 15:10:25,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11540#true} {11540#true} #149#return; {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {11540#true} call ULTIMATE.init(); {11546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {11546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {11540#true} assume true; {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11540#true} {11540#true} #149#return; {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {11540#true} call #t~ret12 := main(); {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {11540#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {11540#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {11540#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {11540#true} assume !(0 != ~p1~0); {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {11540#true} assume !(0 != ~p2~0); {11540#true} is VALID [2022-04-27 15:10:25,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {11540#true} assume !(0 != ~p3~0); {11540#true} is VALID [2022-04-27 15:10:25,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {11540#true} assume !(0 != ~p4~0); {11540#true} is VALID [2022-04-27 15:10:25,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {11540#true} assume !(0 != ~p5~0); {11545#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:25,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {11545#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11545#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:25,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {11545#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11545#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:25,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {11545#(= main_~p5~0 0)} assume !(0 != ~p1~0); {11545#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:25,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {11545#(= main_~p5~0 0)} assume !(0 != ~p2~0); {11545#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:25,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {11545#(= main_~p5~0 0)} assume !(0 != ~p3~0); {11545#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:25,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {11545#(= main_~p5~0 0)} assume !(0 != ~p4~0); {11545#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:25,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {11545#(= main_~p5~0 0)} assume 0 != ~p5~0; {11541#false} is VALID [2022-04-27 15:10:25,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {11541#false} assume 1 != ~lk5~0; {11541#false} is VALID [2022-04-27 15:10:25,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {11541#false} assume !false; {11541#false} is VALID [2022-04-27 15:10:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463548723] [2022-04-27 15:10:25,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463548723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200835030] [2022-04-27 15:10:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:25,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,427 INFO L87 Difference]: Start difference. First operand 521 states and 751 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,559 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-04-27 15:10:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-27 15:10:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-27 15:10:25,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-27 15:10:25,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,657 INFO L225 Difference]: With dead ends: 1181 [2022-04-27 15:10:25,657 INFO L226 Difference]: Without dead ends: 683 [2022-04-27 15:10:25,658 INFO L412 NwaCegarLoop]: 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-27 15:10:25,660 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-04-27 15:10:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-04-27 15:10:25,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,672 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,673 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,688 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-27 15:10:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-27 15:10:25,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-27 15:10:25,690 INFO L87 Difference]: Start difference. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-27 15:10:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,704 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-27 15:10:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-27 15:10:25,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-04-27 15:10:25,720 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-04-27 15:10:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,720 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-04-27 15:10:25,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-04-27 15:10:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:25,721 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:25,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:10:25,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-04-27 15:10:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815824822] [2022-04-27 15:10:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {14880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14874#true} is VALID [2022-04-27 15:10:25,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {14874#true} assume true; {14874#true} is VALID [2022-04-27 15:10:25,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14874#true} {14874#true} #149#return; {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {14874#true} call ULTIMATE.init(); {14880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {14880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {14874#true} assume true; {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14874#true} {14874#true} #149#return; {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {14874#true} call #t~ret12 := main(); {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {14874#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {14874#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {14874#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {14874#true} assume !(0 != ~p1~0); {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {14874#true} assume !(0 != ~p2~0); {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {14874#true} assume !(0 != ~p3~0); {14874#true} is VALID [2022-04-27 15:10:25,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {14874#true} assume !(0 != ~p4~0); {14874#true} is VALID [2022-04-27 15:10:25,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {14874#true} assume 0 != ~p5~0;~lk5~0 := 1; {14879#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:25,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {14879#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {14879#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:25,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {14879#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {14879#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:25,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {14879#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {14879#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:25,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {14879#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {14879#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:25,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {14879#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {14879#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:25,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {14879#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {14879#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:25,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {14879#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {14875#false} is VALID [2022-04-27 15:10:25,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {14875#false} assume 0 != ~p6~0; {14875#false} is VALID [2022-04-27 15:10:25,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {14875#false} assume 1 != ~lk6~0; {14875#false} is VALID [2022-04-27 15:10:25,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {14875#false} assume !false; {14875#false} is VALID [2022-04-27 15:10:25,771 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-27 15:10:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815824822] [2022-04-27 15:10:25,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815824822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399608481] [2022-04-27 15:10:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:25,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,784 INFO L87 Difference]: Start difference. First operand 681 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,909 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-04-27 15:10:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-27 15:10:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-27 15:10:25,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-27 15:10:25,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,003 INFO L225 Difference]: With dead ends: 1021 [2022-04-27 15:10:26,004 INFO L226 Difference]: Without dead ends: 699 [2022-04-27 15:10:26,004 INFO L412 NwaCegarLoop]: 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-27 15:10:26,004 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:26,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-27 15:10:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-27 15:10:26,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,017 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,018 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,033 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-27 15:10:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-27 15:10:26,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-27 15:10:26,036 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-27 15:10:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,051 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-27 15:10:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-27 15:10:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-04-27 15:10:26,068 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-04-27 15:10:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,068 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-04-27 15:10:26,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-04-27 15:10:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:26,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:26,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:10:26,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-04-27 15:10:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227353449] [2022-04-27 15:10:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {18102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18096#true} is VALID [2022-04-27 15:10:26,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {18096#true} assume true; {18096#true} is VALID [2022-04-27 15:10:26,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18096#true} {18096#true} #149#return; {18096#true} is VALID [2022-04-27 15:10:26,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {18096#true} call ULTIMATE.init(); {18102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {18102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18096#true} is VALID [2022-04-27 15:10:26,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {18096#true} assume true; {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18096#true} {18096#true} #149#return; {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {18096#true} call #t~ret12 := main(); {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {18096#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {18096#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {18096#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {18096#true} assume !(0 != ~p1~0); {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {18096#true} assume !(0 != ~p2~0); {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {18096#true} assume !(0 != ~p3~0); {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {18096#true} assume !(0 != ~p4~0); {18096#true} is VALID [2022-04-27 15:10:26,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {18096#true} assume !(0 != ~p5~0); {18096#true} is VALID [2022-04-27 15:10:26,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {18096#true} assume 0 != ~p6~0;~lk6~0 := 1; {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {18101#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {18101#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {18101#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {18101#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {18101#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {18101#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {18101#(= main_~lk6~0 1)} assume 0 != ~p6~0; {18101#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:26,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {18101#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {18097#false} is VALID [2022-04-27 15:10:26,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {18097#false} assume !false; {18097#false} is VALID [2022-04-27 15:10:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227353449] [2022-04-27 15:10:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227353449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730583116] [2022-04-27 15:10:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:26,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,114 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,260 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-04-27 15:10:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-27 15:10:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-27 15:10:26,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-27 15:10:26,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,354 INFO L225 Difference]: With dead ends: 1165 [2022-04-27 15:10:26,355 INFO L226 Difference]: Without dead ends: 1163 [2022-04-27 15:10:26,356 INFO L412 NwaCegarLoop]: 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-27 15:10:26,356 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 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-27 15:10:26,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-27 15:10:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-04-27 15:10:26,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,374 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,375 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,410 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-27 15:10:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-27 15:10:26,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-27 15:10:26,414 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-27 15:10:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,450 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-27 15:10:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-27 15:10:26,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-04-27 15:10:26,488 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-04-27 15:10:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,489 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-04-27 15:10:26,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-04-27 15:10:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:26,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:26,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:10:26,492 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-04-27 15:10:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310280776] [2022-04-27 15:10:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {22748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {22742#true} is VALID [2022-04-27 15:10:26,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {22742#true} assume true; {22742#true} is VALID [2022-04-27 15:10:26,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22742#true} {22742#true} #149#return; {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {22742#true} call ULTIMATE.init(); {22748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {22748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {22742#true} assume true; {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22742#true} {22742#true} #149#return; {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {22742#true} call #t~ret12 := main(); {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {22742#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {22742#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {22742#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {22742#true} assume !(0 != ~p1~0); {22742#true} is VALID [2022-04-27 15:10:26,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {22742#true} assume !(0 != ~p2~0); {22742#true} is VALID [2022-04-27 15:10:26,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {22742#true} assume !(0 != ~p3~0); {22742#true} is VALID [2022-04-27 15:10:26,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {22742#true} assume !(0 != ~p4~0); {22742#true} is VALID [2022-04-27 15:10:26,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {22742#true} assume !(0 != ~p5~0); {22742#true} is VALID [2022-04-27 15:10:26,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {22742#true} assume !(0 != ~p6~0); {22747#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:26,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {22747#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {22747#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:26,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {22747#(= main_~p6~0 0)} assume !(0 != ~p1~0); {22747#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:26,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {22747#(= main_~p6~0 0)} assume !(0 != ~p2~0); {22747#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:26,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {22747#(= main_~p6~0 0)} assume !(0 != ~p3~0); {22747#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:26,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {22747#(= main_~p6~0 0)} assume !(0 != ~p4~0); {22747#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:26,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {22747#(= main_~p6~0 0)} assume !(0 != ~p5~0); {22747#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:26,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {22747#(= main_~p6~0 0)} assume 0 != ~p6~0; {22743#false} is VALID [2022-04-27 15:10:26,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {22743#false} assume 1 != ~lk6~0; {22743#false} is VALID [2022-04-27 15:10:26,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {22743#false} assume !false; {22743#false} is VALID [2022-04-27 15:10:26,533 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-27 15:10:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310280776] [2022-04-27 15:10:26,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310280776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802227627] [2022-04-27 15:10:26,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:26,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,548 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,817 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-04-27 15:10:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:10:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:10:26,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-27 15:10:26,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,956 INFO L225 Difference]: With dead ends: 2317 [2022-04-27 15:10:26,956 INFO L226 Difference]: Without dead ends: 1323 [2022-04-27 15:10:26,957 INFO L412 NwaCegarLoop]: 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-27 15:10:26,957 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:26,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-04-27 15:10:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-04-27 15:10:26,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,979 INFO L74 IsIncluded]: Start isIncluded. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,980 INFO L87 Difference]: Start difference. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,023 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-27 15:10:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-27 15:10:27,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-27 15:10:27,026 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-27 15:10:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,071 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-27 15:10:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-27 15:10:27,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-04-27 15:10:27,118 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-04-27 15:10:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:27,119 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-04-27 15:10:27,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-04-27 15:10:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:27,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:27,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:27,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:10:27,120 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-04-27 15:10:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:27,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981623232] [2022-04-27 15:10:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:27,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {29218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {29212#true} is VALID [2022-04-27 15:10:27,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {29212#true} assume true; {29212#true} is VALID [2022-04-27 15:10:27,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29212#true} {29212#true} #149#return; {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {29212#true} call ULTIMATE.init(); {29218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {29218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {29212#true} assume true; {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29212#true} {29212#true} #149#return; {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {29212#true} call #t~ret12 := main(); {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {29212#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {29212#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {29212#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {29212#true} assume !(0 != ~p1~0); {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {29212#true} assume !(0 != ~p2~0); {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {29212#true} assume !(0 != ~p3~0); {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {29212#true} assume !(0 != ~p4~0); {29212#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {29212#true} assume !(0 != ~p5~0); {29212#true} is VALID [2022-04-27 15:10:27,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {29212#true} assume 0 != ~p6~0;~lk6~0 := 1; {29217#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:27,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {29217#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {29217#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:27,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {29217#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {29217#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:27,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {29217#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {29217#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:27,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {29217#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {29217#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:27,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {29217#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {29217#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:27,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {29217#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {29217#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {29217#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {29213#false} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {29213#false} assume 0 != ~p7~0; {29213#false} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {29213#false} assume 1 != ~lk7~0; {29213#false} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {29213#false} assume !false; {29213#false} is VALID [2022-04-27 15:10:27,173 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-27 15:10:27,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981623232] [2022-04-27 15:10:27,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981623232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321212472] [2022-04-27 15:10:27,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:27,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,187 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,409 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-04-27 15:10:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 15:10:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 15:10:27,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-27 15:10:27,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,532 INFO L225 Difference]: With dead ends: 1981 [2022-04-27 15:10:27,532 INFO L226 Difference]: Without dead ends: 1355 [2022-04-27 15:10:27,533 INFO L412 NwaCegarLoop]: 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-27 15:10:27,533 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:27,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-27 15:10:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-27 15:10:27,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:27,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,554 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,555 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,598 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-27 15:10:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-27 15:10:27,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-27 15:10:27,601 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-27 15:10:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,645 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-27 15:10:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-27 15:10:27,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-04-27 15:10:27,717 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-04-27 15:10:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:27,717 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-04-27 15:10:27,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-04-27 15:10:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:27,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:27,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:27,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:10:27,718 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-04-27 15:10:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:27,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743165472] [2022-04-27 15:10:27,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {35448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35442#true} is VALID [2022-04-27 15:10:27,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-27 15:10:27,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35442#true} {35442#true} #149#return; {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {35442#true} call ULTIMATE.init(); {35448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {35448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35442#true} {35442#true} #149#return; {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {35442#true} call #t~ret12 := main(); {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {35442#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {35442#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {35442#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {35442#true} assume !(0 != ~p1~0); {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {35442#true} assume !(0 != ~p2~0); {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {35442#true} assume !(0 != ~p3~0); {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {35442#true} assume !(0 != ~p4~0); {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {35442#true} assume !(0 != ~p5~0); {35442#true} is VALID [2022-04-27 15:10:27,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {35442#true} assume !(0 != ~p6~0); {35442#true} is VALID [2022-04-27 15:10:27,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {35442#true} assume 0 != ~p7~0;~lk7~0 := 1; {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {35447#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {35447#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {35447#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {35447#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {35447#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {35447#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {35447#(= main_~lk7~0 1)} assume 0 != ~p7~0; {35447#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:27,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {35447#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {35443#false} is VALID [2022-04-27 15:10:27,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {35443#false} assume !false; {35443#false} is VALID [2022-04-27 15:10:27,747 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-27 15:10:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743165472] [2022-04-27 15:10:27,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743165472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070480786] [2022-04-27 15:10:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:27,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,761 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,999 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-04-27 15:10:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:28,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-27 15:10:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-27 15:10:28,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-27 15:10:28,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,183 INFO L225 Difference]: With dead ends: 2187 [2022-04-27 15:10:28,183 INFO L226 Difference]: Without dead ends: 2185 [2022-04-27 15:10:28,184 INFO L412 NwaCegarLoop]: 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-27 15:10:28,184 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:28,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-04-27 15:10:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-04-27 15:10:28,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:28,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,215 INFO L74 IsIncluded]: Start isIncluded. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,216 INFO L87 Difference]: Start difference. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,327 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-27 15:10:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-27 15:10:28,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 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 2185 states. [2022-04-27 15:10:28,331 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 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 2185 states. [2022-04-27 15:10:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,447 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-27 15:10:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-27 15:10:28,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:28,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-04-27 15:10:28,556 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-04-27 15:10:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,556 INFO L495 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-04-27 15:10:28,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-04-27 15:10:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:28,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:10:28,559 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-04-27 15:10:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236915116] [2022-04-27 15:10:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {44279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {44273#true} is VALID [2022-04-27 15:10:28,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-27 15:10:28,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44273#true} {44273#true} #149#return; {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {44273#true} call ULTIMATE.init(); {44279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {44279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44273#true} {44273#true} #149#return; {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {44273#true} call #t~ret12 := main(); {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {44273#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {44273#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {44273#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {44273#true} assume !(0 != ~p1~0); {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {44273#true} assume !(0 != ~p2~0); {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {44273#true} assume !(0 != ~p3~0); {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {44273#true} assume !(0 != ~p4~0); {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {44273#true} assume !(0 != ~p5~0); {44273#true} is VALID [2022-04-27 15:10:28,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {44273#true} assume !(0 != ~p6~0); {44273#true} is VALID [2022-04-27 15:10:28,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {44273#true} assume !(0 != ~p7~0); {44278#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:28,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {44278#(= main_~p7~0 0)} assume !(0 != ~p1~0); {44278#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:28,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {44278#(= main_~p7~0 0)} assume !(0 != ~p2~0); {44278#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:28,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {44278#(= main_~p7~0 0)} assume !(0 != ~p3~0); {44278#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:28,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {44278#(= main_~p7~0 0)} assume !(0 != ~p4~0); {44278#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:28,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {44278#(= main_~p7~0 0)} assume !(0 != ~p5~0); {44278#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:28,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {44278#(= main_~p7~0 0)} assume !(0 != ~p6~0); {44278#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:28,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {44278#(= main_~p7~0 0)} assume 0 != ~p7~0; {44274#false} is VALID [2022-04-27 15:10:28,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {44274#false} assume 1 != ~lk7~0; {44274#false} is VALID [2022-04-27 15:10:28,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {44274#false} assume !false; {44274#false} is VALID [2022-04-27 15:10:28,586 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-27 15:10:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:28,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236915116] [2022-04-27 15:10:28,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236915116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:28,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:28,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220012260] [2022-04-27 15:10:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:28,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:28,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:28,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:28,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:28,599 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,259 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-04-27 15:10:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 15:10:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 15:10:29,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-27 15:10:29,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,335 INFO L225 Difference]: With dead ends: 4553 [2022-04-27 15:10:29,335 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:10:29,339 INFO L412 NwaCegarLoop]: 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-27 15:10:29,340 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:29,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:10:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:10:29,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:29,340 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-27 15:10:29,340 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-27 15:10:29,341 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-27 15:10:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,341 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:29,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,341 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-27 15:10:29,341 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-27 15:10:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,341 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:29,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:29,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:29,341 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-27 15:10:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:10:29,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-27 15:10:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:29,341 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:10:29,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:29,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:10:29,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:10:29,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:10:31,748 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:10:31,749 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 123) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point L77-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,749 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L902 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 123) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L902 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-04-27 15:10:31,750 INFO L895 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-04-27 15:10:31,750 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L98-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 118) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-04-27 15:10:31,751 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-04-27 15:10:31,753 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:31,754 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:10:31,756 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:10:31,756 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-04-27 15:10:31,757 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-04-27 15:10:31,758 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-27 15:10:31,759 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-27 15:10:31,759 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 15:10:31,759 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 15:10:31,759 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:10:31,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:10:31 BoogieIcfgContainer [2022-04-27 15:10:31,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:10:31,762 INFO L158 Benchmark]: Toolchain (without parser) took 10623.81ms. Allocated memory was 164.6MB in the beginning and 399.5MB in the end (delta: 234.9MB). Free memory was 113.3MB in the beginning and 248.4MB in the end (delta: -135.0MB). Peak memory consumption was 216.5MB. Max. memory is 8.0GB. [2022-04-27 15:10:31,763 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 164.6MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:10:31,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.39ms. Allocated memory is still 164.6MB. Free memory was 113.2MB in the beginning and 139.1MB in the end (delta: -25.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-27 15:10:31,763 INFO L158 Benchmark]: Boogie Preprocessor took 20.21ms. Allocated memory is still 164.6MB. Free memory was 139.1MB in the beginning and 137.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:10:31,763 INFO L158 Benchmark]: RCFGBuilder took 235.21ms. Allocated memory is still 164.6MB. Free memory was 137.2MB in the beginning and 124.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 15:10:31,763 INFO L158 Benchmark]: TraceAbstraction took 10135.63ms. Allocated memory was 164.6MB in the beginning and 399.5MB in the end (delta: 234.9MB). Free memory was 123.9MB in the beginning and 248.4MB in the end (delta: -124.5MB). Peak memory consumption was 228.4MB. Max. memory is 8.0GB. [2022-04-27 15:10:31,764 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.25ms. Allocated memory is still 164.6MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.39ms. Allocated memory is still 164.6MB. Free memory was 113.2MB in the beginning and 139.1MB in the end (delta: -25.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.21ms. Allocated memory is still 164.6MB. Free memory was 139.1MB in the beginning and 137.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 235.21ms. Allocated memory is still 164.6MB. Free memory was 137.2MB in the beginning and 124.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10135.63ms. Allocated memory was 164.6MB in the beginning and 399.5MB in the end (delta: 234.9MB). Free memory was 123.9MB in the beginning and 248.4MB in the end (delta: -124.5MB). Peak memory consumption was 228.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 813 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:10:31,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...