/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:57:51,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:57:51,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:57:51,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:57:51,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:57:51,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:57:51,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:57:51,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:57:51,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:57:51,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:57:51,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:57:51,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:57:51,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:57:51,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:57:51,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:57:51,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:57:51,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:57:51,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:57:51,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:57:51,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:57:51,816 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:57:51,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:57:51,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:57:51,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:57:51,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:57:51,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:57:51,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:57:51,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:57:51,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:57:51,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:57:51,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:57:51,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:57:51,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:57:51,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:57:51,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:57:51,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:57:51,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:57:51,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:57:51,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:57:51,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:57:51,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:57:51,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:57:51,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:57:51,830 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:57:51,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:57:51,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:57:51,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:57:51,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:57:51,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:57:51,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:57:51,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:57:51,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:57:51,832 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:57:51,833 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:57:51,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:57:51,833 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:57:51,833 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 14:57:51,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:57:51,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:57:52,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:57:52,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:57:52,001 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:57:52,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2022-04-28 14:57:52,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695b06d0f/64ca57796d9c4cf3a479e74ae4c4b779/FLAG595b05012 [2022-04-28 14:57:52,375 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:57:52,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-04-28 14:57:52,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695b06d0f/64ca57796d9c4cf3a479e74ae4c4b779/FLAG595b05012 [2022-04-28 14:57:52,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/695b06d0f/64ca57796d9c4cf3a479e74ae4c4b779 [2022-04-28 14:57:52,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:57:52,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:57:52,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:57:52,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:57:52,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:57:52,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:52" (1/1) ... [2022-04-28 14:57:52,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50145450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:52, skipping insertion in model container [2022-04-28 14:57:52,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:52" (1/1) ... [2022-04-28 14:57:52,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:57:52,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:57:53,048 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_11.c[4246,4259] [2022-04-28 14:57:53,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:57:53,056 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:57:53,089 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_11.c[4246,4259] [2022-04-28 14:57:53,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:57:53,103 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:57:53,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53 WrapperNode [2022-04-28 14:57:53,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:57:53,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:57:53,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:57:53,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:57:53,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:57:53,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:57:53,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:57:53,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:57:53,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (1/1) ... [2022-04-28 14:57:53,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:57:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:57:53,159 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-28 14:57:53,160 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-28 14:57:53,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:57:53,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:57:53,183 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:57:53,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:57:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:57:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:57:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:57:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:57:53,234 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:57:53,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:57:53,452 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:57:53,457 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:57:53,457 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:57:53,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:53 BoogieIcfgContainer [2022-04-28 14:57:53,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:57:53,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:57:53,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:57:53,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:57:53,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:57:52" (1/3) ... [2022-04-28 14:57:53,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47adb368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:53, skipping insertion in model container [2022-04-28 14:57:53,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:53" (2/3) ... [2022-04-28 14:57:53,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47adb368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:53, skipping insertion in model container [2022-04-28 14:57:53,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:53" (3/3) ... [2022-04-28 14:57:53,465 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-04-28 14:57:53,474 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:57:53,475 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:57:53,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:57:53,507 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5882b2b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49067708 [2022-04-28 14:57:53,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:57:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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-28 14:57:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:57:53,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:53,518 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-28 14:57:53,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 1 times [2022-04-28 14:57:53,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:53,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506169023] [2022-04-28 14:57:53,534 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 2 times [2022-04-28 14:57:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:53,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568374698] [2022-04-28 14:57:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:53,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#(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(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-28 14:57:53,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 14:57:53,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-28 14:57:53,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:53,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(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(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-28 14:57:53,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 14:57:53,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-28 14:57:53,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret16 := main(); {51#true} is VALID [2022-04-28 14:57:53,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {51#true} is VALID [2022-04-28 14:57:53,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {51#true} is VALID [2022-04-28 14:57:53,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {51#true} is VALID [2022-04-28 14:57:53,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume 0 != ~p1~0;~lk1~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p1~0; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:53,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {52#false} is VALID [2022-04-28 14:57:53,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-28 14:57:53,714 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-28 14:57:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:53,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568374698] [2022-04-28 14:57:53,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568374698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:53,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:53,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:53,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:53,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506169023] [2022-04-28 14:57:53,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506169023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:53,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:53,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535241473] [2022-04-28 14:57:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:53,722 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-28 14:57:53,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:53,726 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-28 14:57:53,768 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-28 14:57:53,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:53,788 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.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-28 14:57:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,080 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2022-04-28 14:57:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:54,081 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-28 14:57:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:54,082 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-28 14:57:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 14:57:54,095 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-28 14:57:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 14:57:54,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 14:57:54,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:54,240 INFO L225 Difference]: With dead ends: 94 [2022-04-28 14:57:54,240 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 14:57:54,242 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-28 14:57:54,244 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:54,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 95 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:57:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 14:57:54,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-04-28 14:57:54,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:54,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,277 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,278 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,282 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-28 14:57:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-28 14:57:54,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 14:57:54,284 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 14:57:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,288 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-28 14:57:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-28 14:57:54,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:54,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-04-28 14:57:54,295 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-04-28 14:57:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:54,298 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-04-28 14:57:54,302 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-28 14:57:54,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 98 transitions. [2022-04-28 14:57:54,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-04-28 14:57:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:57:54,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:54,394 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-28 14:57:54,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:57:54,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:54,395 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 1 times [2022-04-28 14:57:54,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:54,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061796319] [2022-04-28 14:57:54,399 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 2 times [2022-04-28 14:57:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:54,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826400456] [2022-04-28 14:57:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:54,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#(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(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-28 14:57:54,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-28 14:57:54,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-28 14:57:54,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:54,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#(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(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-28 14:57:54,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-28 14:57:54,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-28 14:57:54,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret16 := main(); {519#true} is VALID [2022-04-28 14:57:54,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {519#true} is VALID [2022-04-28 14:57:54,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {519#true} is VALID [2022-04-28 14:57:54,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {519#true} is VALID [2022-04-28 14:57:54,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume !(0 != ~p1~0); {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p2~0); {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p10~0); {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:54,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p1~0; {520#false} is VALID [2022-04-28 14:57:54,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {520#false} assume 1 != ~lk1~0; {520#false} is VALID [2022-04-28 14:57:54,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-04-28 14:57:54,487 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-28 14:57:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:54,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826400456] [2022-04-28 14:57:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826400456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:54,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:54,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:54,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:54,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061796319] [2022-04-28 14:57:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061796319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:54,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:54,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147879267] [2022-04-28 14:57:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:54,489 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-28 14:57:54,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:54,490 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-28 14:57:54,502 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-28 14:57:54,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:54,504 INFO L87 Difference]: Start difference. First operand 55 states and 98 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-28 14:57:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,717 INFO L93 Difference]: Finished difference Result 128 states and 233 transitions. [2022-04-28 14:57:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:54,718 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-28 14:57:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:54,718 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-28 14:57:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 14:57:54,722 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-28 14:57:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 14:57:54,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-28 14:57:54,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:54,857 INFO L225 Difference]: With dead ends: 128 [2022-04-28 14:57:54,857 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 14:57:54,858 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-28 14:57:54,861 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:54,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 103 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 14:57:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-28 14:57:54,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:54,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,878 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,880 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,883 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-28 14:57:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-28 14:57:54,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 14:57:54,888 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 14:57:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,892 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-28 14:57:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-28 14:57:54,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:54,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-04-28 14:57:54,897 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-04-28 14:57:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:54,898 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-04-28 14:57:54,898 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-28 14:57:54,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 138 transitions. [2022-04-28 14:57:54,995 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-28 14:57:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-04-28 14:57:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 14:57:54,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:54,996 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-28 14:57:54,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:57:54,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 1 times [2022-04-28 14:57:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934276543] [2022-04-28 14:57:54,997 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 2 times [2022-04-28 14:57:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830546045] [2022-04-28 14:57:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:55,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(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(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 14:57:55,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 14:57:55,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-28 14:57:55,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:55,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#(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(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 14:57:55,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 14:57:55,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-28 14:57:55,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret16 := main(); {1099#true} is VALID [2022-04-28 14:57:55,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {1099#true} is VALID [2022-04-28 14:57:55,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1099#true} is VALID [2022-04-28 14:57:55,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1099#true} is VALID [2022-04-28 14:57:55,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume 0 != ~p1~0;~lk1~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:55,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1100#false} is VALID [2022-04-28 14:57:55,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {1100#false} assume 0 != ~p2~0; {1100#false} is VALID [2022-04-28 14:57:55,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume 1 != ~lk2~0; {1100#false} is VALID [2022-04-28 14:57:55,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-28 14:57:55,074 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-28 14:57:55,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:55,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830546045] [2022-04-28 14:57:55,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830546045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:55,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:55,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:55,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:55,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934276543] [2022-04-28 14:57:55,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934276543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:55,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:55,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340844385] [2022-04-28 14:57:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:55,076 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-28 14:57:55,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:55,076 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-28 14:57:55,088 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-28 14:57:55,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:55,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:55,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:55,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:55,089 INFO L87 Difference]: Start difference. First operand 77 states and 138 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-28 14:57:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,235 INFO L93 Difference]: Finished difference Result 118 states and 208 transitions. [2022-04-28 14:57:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:55,235 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-28 14:57:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:55,236 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-28 14:57:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 14:57:55,239 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-28 14:57:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 14:57:55,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-28 14:57:55,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:55,376 INFO L225 Difference]: With dead ends: 118 [2022-04-28 14:57:55,376 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 14:57:55,376 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-28 14:57:55,379 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:55,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 14:57:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-28 14:57:55,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:55,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,393 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,394 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,418 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-28 14:57:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-28 14:57:55,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:55,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:55,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-28 14:57:55,419 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-28 14:57:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,421 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-28 14:57:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-28 14:57:55,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:55,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:55,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:55,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-04-28 14:57:55,425 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-04-28 14:57:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:55,426 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-04-28 14:57:55,426 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-28 14:57:55,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 140 transitions. [2022-04-28 14:57:55,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-04-28 14:57:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 14:57:55,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:55,537 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-28 14:57:55,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:57:55,537 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:55,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 1 times [2022-04-28 14:57:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:55,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1673040149] [2022-04-28 14:57:55,538 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 2 times [2022-04-28 14:57:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:55,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525418105] [2022-04-28 14:57:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:55,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:55,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {1677#(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(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-28 14:57:55,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 14:57:55,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-28 14:57:55,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:55,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#(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(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-28 14:57:55,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 14:57:55,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-28 14:57:55,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret16 := main(); {1671#true} is VALID [2022-04-28 14:57:55,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {1671#true} is VALID [2022-04-28 14:57:55,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1671#true} is VALID [2022-04-28 14:57:55,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1671#true} is VALID [2022-04-28 14:57:55,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#true} assume !(0 != ~p1~0); {1671#true} is VALID [2022-04-28 14:57:55,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#true} assume !(0 != ~p2~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:55,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p2~0; {1672#false} is VALID [2022-04-28 14:57:55,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {1672#false} assume 1 != ~lk2~0; {1672#false} is VALID [2022-04-28 14:57:55,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-28 14:57:55,601 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-28 14:57:55,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:55,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525418105] [2022-04-28 14:57:55,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525418105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:55,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:55,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:55,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:55,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1673040149] [2022-04-28 14:57:55,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1673040149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:55,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:55,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:55,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112305690] [2022-04-28 14:57:55,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:55,602 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-28 14:57:55,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:55,602 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-28 14:57:55,615 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-28 14:57:55,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:55,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:55,616 INFO L87 Difference]: Start difference. First operand 80 states and 140 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-28 14:57:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,769 INFO L93 Difference]: Finished difference Result 220 states and 396 transitions. [2022-04-28 14:57:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:55,769 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-28 14:57:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:55,770 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-28 14:57:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 14:57:55,772 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-28 14:57:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 14:57:55,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-28 14:57:55,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:55,894 INFO L225 Difference]: With dead ends: 220 [2022-04-28 14:57:55,895 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 14:57:55,895 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-28 14:57:55,896 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:55,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 14:57:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-04-28 14:57:55,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:55,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,906 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,907 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,910 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-28 14:57:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-28 14:57:55,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:55,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:55,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 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 149 states. [2022-04-28 14:57:55,911 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 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 149 states. [2022-04-28 14:57:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,915 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-28 14:57:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-28 14:57:55,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:55,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:55,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:55,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 261 transitions. [2022-04-28 14:57:55,919 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 261 transitions. Word has length 23 [2022-04-28 14:57:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:55,919 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 261 transitions. [2022-04-28 14:57:55,920 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-28 14:57:55,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 261 transitions. [2022-04-28 14:57:56,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 261 transitions. [2022-04-28 14:57:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 14:57:56,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:56,102 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-28 14:57:56,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 14:57:56,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 1 times [2022-04-28 14:57:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:56,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42878477] [2022-04-28 14:57:56,103 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 2 times [2022-04-28 14:57:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:56,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446254465] [2022-04-28 14:57:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:56,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {2721#(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(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-28 14:57:56,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-28 14:57:56,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-28 14:57:56,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {2715#true} call ULTIMATE.init(); {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:56,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#(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(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-28 14:57:56,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-28 14:57:56,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-28 14:57:56,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {2715#true} call #t~ret16 := main(); {2715#true} is VALID [2022-04-28 14:57:56,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2715#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {2715#true} is VALID [2022-04-28 14:57:56,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {2715#true} is VALID [2022-04-28 14:57:56,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {2715#true} is VALID [2022-04-28 14:57:56,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !(0 != ~p1~0); {2715#true} is VALID [2022-04-28 14:57:56,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {2715#true} assume 0 != ~p2~0;~lk2~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:56,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {2720#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2716#false} is VALID [2022-04-28 14:57:56,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-04-28 14:57:56,177 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-28 14:57:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:56,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446254465] [2022-04-28 14:57:56,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446254465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:56,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:56,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:56,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:56,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42878477] [2022-04-28 14:57:56,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42878477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:56,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:56,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514704079] [2022-04-28 14:57:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:56,178 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-28 14:57:56,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:56,179 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-28 14:57:56,194 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-28 14:57:56,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:56,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:56,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:56,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:56,195 INFO L87 Difference]: Start difference. First operand 147 states and 261 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-28 14:57:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,351 INFO L93 Difference]: Finished difference Result 191 states and 339 transitions. [2022-04-28 14:57:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:56,352 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-28 14:57:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:56,352 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-28 14:57:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 14:57:56,353 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-28 14:57:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 14:57:56,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-28 14:57:56,438 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-28 14:57:56,443 INFO L225 Difference]: With dead ends: 191 [2022-04-28 14:57:56,443 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 14:57:56,444 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-28 14:57:56,444 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:56,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 14:57:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2022-04-28 14:57:56,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:56,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,454 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,454 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,460 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-28 14:57:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-28 14:57:56,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:56,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:56,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 189 states. [2022-04-28 14:57:56,461 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 189 states. [2022-04-28 14:57:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,468 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-28 14:57:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-28 14:57:56,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:56,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:56,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:56,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-04-28 14:57:56,474 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-04-28 14:57:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:56,474 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-04-28 14:57:56,474 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-28 14:57:56,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 259 transitions. [2022-04-28 14:57:56,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-04-28 14:57:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:57:56,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:56,664 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-28 14:57:56,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 14:57:56,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 1 times [2022-04-28 14:57:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1509415598] [2022-04-28 14:57:56,665 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 2 times [2022-04-28 14:57:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992329640] [2022-04-28 14:57:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:56,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:56,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {3787#(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(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-28 14:57:56,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-28 14:57:56,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-28 14:57:56,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {3781#true} call ULTIMATE.init(); {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:56,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {3787#(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(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-28 14:57:56,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-28 14:57:56,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-28 14:57:56,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {3781#true} call #t~ret16 := main(); {3781#true} is VALID [2022-04-28 14:57:56,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {3781#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {3781#true} is VALID [2022-04-28 14:57:56,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {3781#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {3781#true} is VALID [2022-04-28 14:57:56,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {3781#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {3781#true} is VALID [2022-04-28 14:57:56,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {3781#true} assume !(0 != ~p1~0); {3781#true} is VALID [2022-04-28 14:57:56,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {3781#true} assume !(0 != ~p2~0); {3781#true} is VALID [2022-04-28 14:57:56,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {3781#true} assume 0 != ~p3~0;~lk3~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:56,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {3786#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3782#false} is VALID [2022-04-28 14:57:56,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {3782#false} assume !false; {3782#false} is VALID [2022-04-28 14:57:56,711 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-28 14:57:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992329640] [2022-04-28 14:57:56,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992329640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:56,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:56,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:56,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:56,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1509415598] [2022-04-28 14:57:56,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1509415598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:56,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:56,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:56,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209969754] [2022-04-28 14:57:56,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:56,712 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-28 14:57:56,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:56,712 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-28 14:57:56,724 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-28 14:57:56,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:56,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:56,726 INFO L87 Difference]: Start difference. First operand 147 states and 259 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-28 14:57:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,870 INFO L93 Difference]: Finished difference Result 275 states and 491 transitions. [2022-04-28 14:57:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:56,870 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-28 14:57:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:56,871 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-28 14:57:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 14:57:56,872 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-28 14:57:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 14:57:56,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-28 14:57:56,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:56,969 INFO L225 Difference]: With dead ends: 275 [2022-04-28 14:57:56,969 INFO L226 Difference]: Without dead ends: 273 [2022-04-28 14:57:56,969 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-28 14:57:56,970 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:56,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-28 14:57:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2022-04-28 14:57:56,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:56,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,985 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,986 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,991 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-28 14:57:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-28 14:57:56,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:56,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:56,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 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 273 states. [2022-04-28 14:57:56,992 INFO L87 Difference]: Start difference. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 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 273 states. [2022-04-28 14:57:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,996 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-28 14:57:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-28 14:57:56,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:56,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:56,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:56,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 349 transitions. [2022-04-28 14:57:57,016 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 349 transitions. Word has length 24 [2022-04-28 14:57:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:57,017 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 349 transitions. [2022-04-28 14:57:57,017 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-28 14:57:57,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 349 transitions. [2022-04-28 14:57:57,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 349 transitions. [2022-04-28 14:57:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:57:57,288 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:57,288 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-28 14:57:57,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 14:57:57,288 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:57,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 1 times [2022-04-28 14:57:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:57,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676621761] [2022-04-28 14:57:57,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 2 times [2022-04-28 14:57:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:57,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327085318] [2022-04-28 14:57:57,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:57,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:57,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {5293#(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(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-28 14:57:57,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-28 14:57:57,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-28 14:57:57,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:57,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {5293#(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(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-28 14:57:57,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-28 14:57:57,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-28 14:57:57,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {5287#true} call #t~ret16 := main(); {5287#true} is VALID [2022-04-28 14:57:57,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {5287#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {5287#true} is VALID [2022-04-28 14:57:57,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {5287#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {5287#true} is VALID [2022-04-28 14:57:57,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {5287#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {5287#true} is VALID [2022-04-28 14:57:57,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {5287#true} assume !(0 != ~p1~0); {5287#true} is VALID [2022-04-28 14:57:57,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {5287#true} assume !(0 != ~p2~0); {5287#true} is VALID [2022-04-28 14:57:57,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {5287#true} assume !(0 != ~p3~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:57,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p3~0; {5288#false} is VALID [2022-04-28 14:57:57,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {5288#false} assume 1 != ~lk3~0; {5288#false} is VALID [2022-04-28 14:57:57,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2022-04-28 14:57:57,334 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-28 14:57:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327085318] [2022-04-28 14:57:57,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327085318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:57,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:57,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:57,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:57,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676621761] [2022-04-28 14:57:57,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676621761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:57,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:57,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143041802] [2022-04-28 14:57:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:57,335 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-28 14:57:57,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:57,336 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-28 14:57:57,348 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-28 14:57:57,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:57,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:57,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:57,349 INFO L87 Difference]: Start difference. First operand 199 states and 349 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-28 14:57:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:57,503 INFO L93 Difference]: Finished difference Result 471 states and 835 transitions. [2022-04-28 14:57:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:57,503 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-28 14:57:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:57,504 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-28 14:57:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 14:57:57,505 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-28 14:57:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 14:57:57,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-28 14:57:57,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:57,621 INFO L225 Difference]: With dead ends: 471 [2022-04-28 14:57:57,621 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 14:57:57,622 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-28 14:57:57,622 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:57,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 14:57:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2022-04-28 14:57:57,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:57,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:57,636 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:57,637 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:57,641 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-28 14:57:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-28 14:57:57,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:57,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:57,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 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 281 states. [2022-04-28 14:57:57,643 INFO L87 Difference]: Start difference. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 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 281 states. [2022-04-28 14:57:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:57,647 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-28 14:57:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-28 14:57:57,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:57,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:57,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:57,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 487 transitions. [2022-04-28 14:57:57,653 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 487 transitions. Word has length 24 [2022-04-28 14:57:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:57,653 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 487 transitions. [2022-04-28 14:57:57,653 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-28 14:57:57,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 279 states and 487 transitions. [2022-04-28 14:57:58,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 487 transitions. [2022-04-28 14:57:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:57:58,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:58,079 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, 1] [2022-04-28 14:57:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 14:57:58,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 1 times [2022-04-28 14:57:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338431007] [2022-04-28 14:57:58,080 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 2 times [2022-04-28 14:57:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882140333] [2022-04-28 14:57:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:58,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {7367#(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(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-28 14:57:58,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 14:57:58,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-28 14:57:58,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:58,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#(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(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-28 14:57:58,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 14:57:58,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-28 14:57:58,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret16 := main(); {7361#true} is VALID [2022-04-28 14:57:58,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {7361#true} is VALID [2022-04-28 14:57:58,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {7361#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {7361#true} is VALID [2022-04-28 14:57:58,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {7361#true} is VALID [2022-04-28 14:57:58,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 != ~p1~0); {7361#true} is VALID [2022-04-28 14:57:58,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume !(0 != ~p2~0); {7361#true} is VALID [2022-04-28 14:57:58,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {7361#true} assume 0 != ~p3~0;~lk3~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:58,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7362#false} is VALID [2022-04-28 14:57:58,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {7362#false} assume 0 != ~p4~0; {7362#false} is VALID [2022-04-28 14:57:58,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {7362#false} assume 1 != ~lk4~0; {7362#false} is VALID [2022-04-28 14:57:58,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-28 14:57:58,132 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-28 14:57:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882140333] [2022-04-28 14:57:58,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882140333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:58,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:58,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:58,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:58,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338431007] [2022-04-28 14:57:58,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338431007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:58,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:58,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515406944] [2022-04-28 14:57:58,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 14:57:58,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:58,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:58,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:58,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:58,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:58,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:58,147 INFO L87 Difference]: Start difference. First operand 279 states and 487 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:58,299 INFO L93 Difference]: Finished difference Result 421 states and 733 transitions. [2022-04-28 14:57:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:58,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 14:57:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 14:57:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 14:57:58,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-28 14:57:58,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:58,421 INFO L225 Difference]: With dead ends: 421 [2022-04-28 14:57:58,421 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 14:57:58,422 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-28 14:57:58,422 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:58,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 14:57:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-04-28 14:57:58,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:58,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,436 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,437 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:58,446 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-28 14:57:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-28 14:57:58,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:58,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:58,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 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 287 states. [2022-04-28 14:57:58,449 INFO L87 Difference]: Start difference. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 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 287 states. [2022-04-28 14:57:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:58,453 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-28 14:57:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-28 14:57:58,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:58,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:58,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:58,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 491 transitions. [2022-04-28 14:57:58,459 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 491 transitions. Word has length 25 [2022-04-28 14:57:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:58,459 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 491 transitions. [2022-04-28 14:57:58,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 491 transitions. [2022-04-28 14:57:58,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 491 transitions. [2022-04-28 14:57:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:57:58,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:58,870 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, 1] [2022-04-28 14:57:58,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 14:57:58,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 1 times [2022-04-28 14:57:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:58,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [532518688] [2022-04-28 14:57:58,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 2 times [2022-04-28 14:57:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:58,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984207543] [2022-04-28 14:57:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:58,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:58,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {9365#(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(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {9359#true} call ULTIMATE.init(); {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:58,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {9365#(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(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {9359#true} call #t~ret16 := main(); {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {9359#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {9359#true} is VALID [2022-04-28 14:57:58,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {9359#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {9359#true} is VALID [2022-04-28 14:57:58,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {9359#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {9359#true} is VALID [2022-04-28 14:57:58,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {9359#true} assume !(0 != ~p1~0); {9359#true} is VALID [2022-04-28 14:57:58,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {9359#true} assume !(0 != ~p2~0); {9359#true} is VALID [2022-04-28 14:57:58,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {9359#true} assume !(0 != ~p3~0); {9359#true} is VALID [2022-04-28 14:57:58,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {9359#true} assume 0 != ~p4~0;~lk4~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p4~0; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:58,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {9364#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {9360#false} is VALID [2022-04-28 14:57:58,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {9360#false} assume !false; {9360#false} is VALID [2022-04-28 14:57:58,918 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-28 14:57:58,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:58,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984207543] [2022-04-28 14:57:58,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984207543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:58,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:58,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:58,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:58,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [532518688] [2022-04-28 14:57:58,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [532518688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:58,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:58,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:58,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024663288] [2022-04-28 14:57:58,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:58,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 14:57:58,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:58,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:58,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:58,931 INFO L87 Difference]: Start difference. First operand 285 states and 491 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:59,078 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2022-04-28 14:57:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:59,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 14:57:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 14:57:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 14:57:59,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-28 14:57:59,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:59,170 INFO L225 Difference]: With dead ends: 525 [2022-04-28 14:57:59,170 INFO L226 Difference]: Without dead ends: 523 [2022-04-28 14:57:59,170 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-28 14:57:59,171 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:59,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-28 14:57:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 393. [2022-04-28 14:57:59,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:59,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,190 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,190 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:59,201 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-28 14:57:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-28 14:57:59,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:59,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:59,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 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 523 states. [2022-04-28 14:57:59,203 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 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 523 states. [2022-04-28 14:57:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:59,213 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-28 14:57:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-28 14:57:59,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:59,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:59,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:59,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 667 transitions. [2022-04-28 14:57:59,222 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 667 transitions. Word has length 25 [2022-04-28 14:57:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:59,222 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 667 transitions. [2022-04-28 14:57:59,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 667 transitions. [2022-04-28 14:57:59,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 667 transitions. [2022-04-28 14:57:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:57:59,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:59,757 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, 1] [2022-04-28 14:57:59,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 14:57:59,758 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 1 times [2022-04-28 14:57:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:59,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [278714343] [2022-04-28 14:57:59,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 2 times [2022-04-28 14:57:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:59,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434617515] [2022-04-28 14:57:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:59,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {12259#(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(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-28 14:57:59,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-28 14:57:59,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-28 14:57:59,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {12253#true} call ULTIMATE.init(); {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:59,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {12259#(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(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-28 14:57:59,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-28 14:57:59,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-28 14:57:59,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#true} call #t~ret16 := main(); {12253#true} is VALID [2022-04-28 14:57:59,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {12253#true} is VALID [2022-04-28 14:57:59,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {12253#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {12253#true} is VALID [2022-04-28 14:57:59,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {12253#true} is VALID [2022-04-28 14:57:59,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#true} assume !(0 != ~p1~0); {12253#true} is VALID [2022-04-28 14:57:59,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#true} assume !(0 != ~p2~0); {12253#true} is VALID [2022-04-28 14:57:59,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {12253#true} assume !(0 != ~p3~0); {12253#true} is VALID [2022-04-28 14:57:59,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#true} assume !(0 != ~p4~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p10~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p1~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p2~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p3~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:59,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p4~0; {12254#false} is VALID [2022-04-28 14:57:59,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {12254#false} assume 1 != ~lk4~0; {12254#false} is VALID [2022-04-28 14:57:59,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {12254#false} assume !false; {12254#false} is VALID [2022-04-28 14:57:59,798 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-28 14:57:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:59,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434617515] [2022-04-28 14:57:59,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434617515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:59,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:59,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:59,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:59,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [278714343] [2022-04-28 14:57:59,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [278714343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:59,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:59,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379549900] [2022-04-28 14:57:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:59,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 14:57:59,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:59,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:59,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:59,811 INFO L87 Difference]: Start difference. First operand 393 states and 667 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:00,003 INFO L93 Difference]: Finished difference Result 925 states and 1581 transitions. [2022-04-28 14:58:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 14:58:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-28 14:58:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-28 14:58:00,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-28 14:58:00,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:00,128 INFO L225 Difference]: With dead ends: 925 [2022-04-28 14:58:00,128 INFO L226 Difference]: Without dead ends: 547 [2022-04-28 14:58:00,129 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-28 14:58:00,130 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:00,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-28 14:58:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-04-28 14:58:00,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:00,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,159 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,160 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:00,171 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-28 14:58:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-28 14:58:00,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:00,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:00,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 547 states. [2022-04-28 14:58:00,173 INFO L87 Difference]: Start difference. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 547 states. [2022-04-28 14:58:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:00,184 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-28 14:58:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-28 14:58:00,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:00,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:00,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:00,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 919 transitions. [2022-04-28 14:58:00,198 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 919 transitions. Word has length 25 [2022-04-28 14:58:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:00,199 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 919 transitions. [2022-04-28 14:58:00,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 545 states and 919 transitions. [2022-04-28 14:58:00,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 919 transitions. [2022-04-28 14:58:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:00,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:00,988 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, 1, 1] [2022-04-28 14:58:00,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 14:58:00,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 1 times [2022-04-28 14:58:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:00,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179672680] [2022-04-28 14:58:00,989 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 2 times [2022-04-28 14:58:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:00,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786335626] [2022-04-28 14:58:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:01,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {16305#(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(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-28 14:58:01,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-28 14:58:01,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-28 14:58:01,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {16299#true} call ULTIMATE.init(); {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:01,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {16305#(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(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-28 14:58:01,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-28 14:58:01,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {16299#true} call #t~ret16 := main(); {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {16299#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {16299#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {16299#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {16299#true} assume !(0 != ~p1~0); {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {16299#true} assume !(0 != ~p2~0); {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {16299#true} assume !(0 != ~p3~0); {16299#true} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {16299#true} assume 0 != ~p4~0;~lk4~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:58:01,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {16300#false} is VALID [2022-04-28 14:58:01,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#false} assume 0 != ~p5~0; {16300#false} is VALID [2022-04-28 14:58:01,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {16300#false} assume 1 != ~lk5~0; {16300#false} is VALID [2022-04-28 14:58:01,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {16300#false} assume !false; {16300#false} is VALID [2022-04-28 14:58:01,037 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-28 14:58:01,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:01,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786335626] [2022-04-28 14:58:01,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786335626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:01,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:01,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:01,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:01,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179672680] [2022-04-28 14:58:01,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179672680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:01,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:01,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769762334] [2022-04-28 14:58:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 14:58:01,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:01,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:01,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:01,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:01,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:01,051 INFO L87 Difference]: Start difference. First operand 545 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:01,218 INFO L93 Difference]: Finished difference Result 817 states and 1373 transitions. [2022-04-28 14:58:01,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 14:58:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-28 14:58:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-28 14:58:01,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-28 14:58:01,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:01,350 INFO L225 Difference]: With dead ends: 817 [2022-04-28 14:58:01,350 INFO L226 Difference]: Without dead ends: 555 [2022-04-28 14:58:01,351 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-28 14:58:01,351 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:01,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 114 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-28 14:58:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2022-04-28 14:58:01,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:01,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,380 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,380 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:01,391 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-28 14:58:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-28 14:58:01,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:01,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:01,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 555 states. [2022-04-28 14:58:01,393 INFO L87 Difference]: Start difference. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 555 states. [2022-04-28 14:58:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:01,403 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-28 14:58:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-28 14:58:01,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:01,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:01,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:01,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2022-04-28 14:58:01,419 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 26 [2022-04-28 14:58:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:01,420 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2022-04-28 14:58:01,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 919 transitions. [2022-04-28 14:58:02,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2022-04-28 14:58:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:02,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:02,200 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, 1, 1] [2022-04-28 14:58:02,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 14:58:02,200 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 1 times [2022-04-28 14:58:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:02,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034144505] [2022-04-28 14:58:02,201 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 2 times [2022-04-28 14:58:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:02,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295982377] [2022-04-28 14:58:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:02,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:02,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {20167#(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(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-28 14:58:02,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-28 14:58:02,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-28 14:58:02,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {20161#true} call ULTIMATE.init(); {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:02,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {20167#(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(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-28 14:58:02,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-28 14:58:02,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-28 14:58:02,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {20161#true} call #t~ret16 := main(); {20161#true} is VALID [2022-04-28 14:58:02,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {20161#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {20161#true} is VALID [2022-04-28 14:58:02,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {20161#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {20161#true} is VALID [2022-04-28 14:58:02,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {20161#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {20161#true} is VALID [2022-04-28 14:58:02,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {20161#true} assume !(0 != ~p1~0); {20161#true} is VALID [2022-04-28 14:58:02,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {20161#true} assume !(0 != ~p2~0); {20161#true} is VALID [2022-04-28 14:58:02,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {20161#true} assume !(0 != ~p3~0); {20161#true} is VALID [2022-04-28 14:58:02,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {20161#true} assume !(0 != ~p4~0); {20161#true} is VALID [2022-04-28 14:58:02,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#true} assume 0 != ~p5~0;~lk5~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p5~0; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 14:58:02,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {20166#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {20162#false} is VALID [2022-04-28 14:58:02,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {20162#false} assume !false; {20162#false} is VALID [2022-04-28 14:58:02,255 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-28 14:58:02,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295982377] [2022-04-28 14:58:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295982377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:02,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:02,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:02,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034144505] [2022-04-28 14:58:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034144505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:02,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:02,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128141706] [2022-04-28 14:58:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 14:58:02,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:02,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:02,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:02,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:02,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:02,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:02,270 INFO L87 Difference]: Start difference. First operand 553 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:02,484 INFO L93 Difference]: Finished difference Result 1005 states and 1697 transitions. [2022-04-28 14:58:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:02,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 14:58:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 14:58:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 14:58:02,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 14:58:02,565 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-28 14:58:02,610 INFO L225 Difference]: With dead ends: 1005 [2022-04-28 14:58:02,611 INFO L226 Difference]: Without dead ends: 1003 [2022-04-28 14:58:02,612 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-28 14:58:02,612 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:02,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-28 14:58:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 777. [2022-04-28 14:58:02,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:02,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,655 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,656 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:02,685 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-28 14:58:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-28 14:58:02,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:02,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:02,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 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 1003 states. [2022-04-28 14:58:02,688 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 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 1003 states. [2022-04-28 14:58:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:02,717 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-28 14:58:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-28 14:58:02,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:02,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:02,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:02,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1263 transitions. [2022-04-28 14:58:02,745 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1263 transitions. Word has length 26 [2022-04-28 14:58:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:02,745 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1263 transitions. [2022-04-28 14:58:02,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:02,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1263 transitions. [2022-04-28 14:58:03,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1263 transitions. [2022-04-28 14:58:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:03,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:03,828 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, 1, 1] [2022-04-28 14:58:03,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 14:58:03,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 1 times [2022-04-28 14:58:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:03,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018523279] [2022-04-28 14:58:03,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:03,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 2 times [2022-04-28 14:58:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:03,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521706076] [2022-04-28 14:58:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:03,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {25749#(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(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-28 14:58:03,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-28 14:58:03,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-28 14:58:03,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {25743#true} call ULTIMATE.init(); {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:03,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {25749#(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(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-28 14:58:03,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-28 14:58:03,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {25743#true} call #t~ret16 := main(); {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {25743#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {25743#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {25743#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {25743#true} assume !(0 != ~p1~0); {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {25743#true} assume !(0 != ~p2~0); {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {25743#true} assume !(0 != ~p3~0); {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {25743#true} assume !(0 != ~p4~0); {25743#true} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {25743#true} assume !(0 != ~p5~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p10~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p1~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p2~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p3~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p4~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:03,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p5~0; {25744#false} is VALID [2022-04-28 14:58:03,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {25744#false} assume 1 != ~lk5~0; {25744#false} is VALID [2022-04-28 14:58:03,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {25744#false} assume !false; {25744#false} is VALID [2022-04-28 14:58:03,870 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-28 14:58:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:03,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521706076] [2022-04-28 14:58:03,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521706076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:03,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:03,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:03,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:03,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018523279] [2022-04-28 14:58:03,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018523279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:03,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:03,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405779048] [2022-04-28 14:58:03,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 14:58:03,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:03,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:03,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:03,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:03,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:03,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:03,884 INFO L87 Difference]: Start difference. First operand 777 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:04,221 INFO L93 Difference]: Finished difference Result 1821 states and 2977 transitions. [2022-04-28 14:58:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:04,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 14:58:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-28 14:58:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-28 14:58:04,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 198 transitions. [2022-04-28 14:58:04,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:04,397 INFO L225 Difference]: With dead ends: 1821 [2022-04-28 14:58:04,397 INFO L226 Difference]: Without dead ends: 1067 [2022-04-28 14:58:04,398 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-28 14:58:04,399 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:04,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 111 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-04-28 14:58:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2022-04-28 14:58:04,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:04,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,459 INFO L74 IsIncluded]: Start isIncluded. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,460 INFO L87 Difference]: Start difference. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:04,494 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-28 14:58:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-28 14:58:04,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:04,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:04,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1067 states. [2022-04-28 14:58:04,498 INFO L87 Difference]: Start difference. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1067 states. [2022-04-28 14:58:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:04,529 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-28 14:58:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-28 14:58:04,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:04,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:04,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:04,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1719 transitions. [2022-04-28 14:58:04,579 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1719 transitions. Word has length 26 [2022-04-28 14:58:04,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:04,580 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1719 transitions. [2022-04-28 14:58:04,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1065 states and 1719 transitions. [2022-04-28 14:58:06,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1719 transitions. [2022-04-28 14:58:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:06,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:06,089 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, 1, 1, 1] [2022-04-28 14:58:06,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 14:58:06,089 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 1 times [2022-04-28 14:58:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:06,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1355272146] [2022-04-28 14:58:06,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 2 times [2022-04-28 14:58:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:06,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523598181] [2022-04-28 14:58:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:06,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {33667#(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(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {33661#true} call ULTIMATE.init(); {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:06,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {33667#(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(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {33661#true} call #t~ret16 := main(); {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {33661#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {33661#true} is VALID [2022-04-28 14:58:06,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {33661#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {33661#true} is VALID [2022-04-28 14:58:06,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {33661#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {33661#true} is VALID [2022-04-28 14:58:06,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {33661#true} assume !(0 != ~p1~0); {33661#true} is VALID [2022-04-28 14:58:06,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {33661#true} assume !(0 != ~p2~0); {33661#true} is VALID [2022-04-28 14:58:06,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {33661#true} assume !(0 != ~p3~0); {33661#true} is VALID [2022-04-28 14:58:06,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {33661#true} assume !(0 != ~p4~0); {33661#true} is VALID [2022-04-28 14:58:06,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {33661#true} assume 0 != ~p5~0;~lk5~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:06,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {33662#false} is VALID [2022-04-28 14:58:06,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {33662#false} assume 0 != ~p6~0; {33662#false} is VALID [2022-04-28 14:58:06,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {33662#false} assume 1 != ~lk6~0; {33662#false} is VALID [2022-04-28 14:58:06,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {33662#false} assume !false; {33662#false} is VALID [2022-04-28 14:58:06,144 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-28 14:58:06,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:06,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523598181] [2022-04-28 14:58:06,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523598181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:06,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:06,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:06,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:06,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1355272146] [2022-04-28 14:58:06,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1355272146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:06,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:06,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:06,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814633411] [2022-04-28 14:58:06,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:06,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 14:58:06,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:06,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:06,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:06,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:06,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:06,160 INFO L87 Difference]: Start difference. First operand 1065 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:06,445 INFO L93 Difference]: Finished difference Result 1597 states and 2569 transitions. [2022-04-28 14:58:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 14:58:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-28 14:58:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-28 14:58:06,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-04-28 14:58:06,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:06,611 INFO L225 Difference]: With dead ends: 1597 [2022-04-28 14:58:06,611 INFO L226 Difference]: Without dead ends: 1083 [2022-04-28 14:58:06,612 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-28 14:58:06,613 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:06,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-04-28 14:58:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-04-28 14:58:06,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:06,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,676 INFO L74 IsIncluded]: Start isIncluded. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,677 INFO L87 Difference]: Start difference. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:06,708 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-28 14:58:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-28 14:58:06,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:06,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:06,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-28 14:58:06,712 INFO L87 Difference]: Start difference. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-28 14:58:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:06,743 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-28 14:58:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-28 14:58:06,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:06,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:06,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:06,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-04-28 14:58:06,791 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-04-28 14:58:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:06,791 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-04-28 14:58:06,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1081 states and 1719 transitions. [2022-04-28 14:58:08,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-04-28 14:58:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:08,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:08,253 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, 1, 1, 1] [2022-04-28 14:58:08,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 14:58:08,253 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 1 times [2022-04-28 14:58:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:08,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148649739] [2022-04-28 14:58:08,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 2 times [2022-04-28 14:58:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:08,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428044075] [2022-04-28 14:58:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:08,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {41201#(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(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-28 14:58:08,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 14:58:08,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {41201#(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(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret16 := main(); {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {41195#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 != ~p1~0); {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume !(0 != ~p2~0); {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {41195#true} assume !(0 != ~p3~0); {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {41195#true} assume !(0 != ~p4~0); {41195#true} is VALID [2022-04-28 14:58:08,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} assume !(0 != ~p5~0); {41195#true} is VALID [2022-04-28 14:58:08,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume 0 != ~p6~0;~lk6~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p6~0; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:08,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {41200#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {41196#false} is VALID [2022-04-28 14:58:08,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-28 14:58:08,285 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-28 14:58:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:08,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428044075] [2022-04-28 14:58:08,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428044075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:08,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:08,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:08,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:08,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148649739] [2022-04-28 14:58:08,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148649739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:08,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:08,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428386786] [2022-04-28 14:58:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:08,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 14:58:08,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:08,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:08,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:08,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:08,299 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:08,684 INFO L93 Difference]: Finished difference Result 1933 states and 3129 transitions. [2022-04-28 14:58:08,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:08,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 14:58:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 14:58:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 14:58:08,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-28 14:58:08,757 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-28 14:58:08,904 INFO L225 Difference]: With dead ends: 1933 [2022-04-28 14:58:08,904 INFO L226 Difference]: Without dead ends: 1931 [2022-04-28 14:58:08,904 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-28 14:58:08,905 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:08,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-28 14:58:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-04-28 14:58:08,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:09,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:09,004 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:09,006 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:09,099 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-28 14:58:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-28 14:58:09,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:09,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:09,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-28 14:58:09,104 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-28 14:58:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:09,202 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-28 14:58:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-28 14:58:09,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:09,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:09,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:09,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-04-28 14:58:09,320 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-04-28 14:58:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:09,320 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-04-28 14:58:09,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:09,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2391 transitions. [2022-04-28 14:58:11,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2391 edges. 2391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-04-28 14:58:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:11,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:11,394 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, 1, 1, 1] [2022-04-28 14:58:11,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 14:58:11,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 1 times [2022-04-28 14:58:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:11,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1088110871] [2022-04-28 14:58:11,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 2 times [2022-04-28 14:58:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:11,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208875527] [2022-04-28 14:58:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:11,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:11,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {52031#(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(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-28 14:58:11,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-28 14:58:11,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-28 14:58:11,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {52025#true} call ULTIMATE.init(); {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {52031#(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(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {52025#true} call #t~ret16 := main(); {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {52025#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {52025#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {52025#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {52025#true} assume !(0 != ~p1~0); {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {52025#true} assume !(0 != ~p2~0); {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {52025#true} assume !(0 != ~p3~0); {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {52025#true} assume !(0 != ~p4~0); {52025#true} is VALID [2022-04-28 14:58:11,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {52025#true} assume !(0 != ~p5~0); {52025#true} is VALID [2022-04-28 14:58:11,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {52025#true} assume !(0 != ~p6~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p10~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p1~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p2~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p3~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p4~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p5~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:11,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p6~0; {52026#false} is VALID [2022-04-28 14:58:11,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {52026#false} assume 1 != ~lk6~0; {52026#false} is VALID [2022-04-28 14:58:11,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {52026#false} assume !false; {52026#false} is VALID [2022-04-28 14:58:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:58:11,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:11,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208875527] [2022-04-28 14:58:11,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208875527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:11,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:11,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:11,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:11,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1088110871] [2022-04-28 14:58:11,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1088110871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:11,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:11,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602243359] [2022-04-28 14:58:11,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:11,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 14:58:11,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:11,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:11,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:11,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:11,475 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:12,304 INFO L93 Difference]: Finished difference Result 3597 states and 5593 transitions. [2022-04-28 14:58:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 14:58:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-28 14:58:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-28 14:58:12,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-28 14:58:12,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:12,575 INFO L225 Difference]: With dead ends: 3597 [2022-04-28 14:58:12,576 INFO L226 Difference]: Without dead ends: 2091 [2022-04-28 14:58:12,578 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-28 14:58:12,578 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:12,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-28 14:58:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-04-28 14:58:12,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:12,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:12,717 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:12,718 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:12,821 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-28 14:58:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-28 14:58:12,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:12,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:12,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-28 14:58:12,828 INFO L87 Difference]: Start difference. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-28 14:58:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:12,935 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-28 14:58:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-28 14:58:12,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:12,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:12,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:12,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-04-28 14:58:13,119 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-04-28 14:58:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:13,119 INFO L495 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-04-28 14:58:13,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:13,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2089 states and 3207 transitions. [2022-04-28 14:58:16,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-04-28 14:58:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:16,124 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:16,124 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, 1, 1, 1, 1] [2022-04-28 14:58:16,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 14:58:16,125 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 1 times [2022-04-28 14:58:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:16,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437422481] [2022-04-28 14:58:16,125 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 2 times [2022-04-28 14:58:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:16,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085528181] [2022-04-28 14:58:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:16,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {67597#(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(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-28 14:58:16,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-28 14:58:16,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-28 14:58:16,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {67591#true} call ULTIMATE.init(); {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:16,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {67597#(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(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-28 14:58:16,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-28 14:58:16,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-28 14:58:16,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {67591#true} call #t~ret16 := main(); {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {67591#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {67591#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {67591#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {67591#true} assume !(0 != ~p1~0); {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {67591#true} assume !(0 != ~p2~0); {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {67591#true} assume !(0 != ~p3~0); {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {67591#true} assume !(0 != ~p4~0); {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {67591#true} assume !(0 != ~p5~0); {67591#true} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {67591#true} assume 0 != ~p6~0;~lk6~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:16,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {67592#false} is VALID [2022-04-28 14:58:16,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {67592#false} assume 0 != ~p7~0; {67592#false} is VALID [2022-04-28 14:58:16,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {67592#false} assume 1 != ~lk7~0; {67592#false} is VALID [2022-04-28 14:58:16,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {67592#false} assume !false; {67592#false} is VALID [2022-04-28 14:58:16,171 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-28 14:58:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:16,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085528181] [2022-04-28 14:58:16,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085528181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:16,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:16,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:16,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437422481] [2022-04-28 14:58:16,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437422481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:16,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:16,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:16,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330089964] [2022-04-28 14:58:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 14:58:16,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:16,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:16,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:16,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:16,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:16,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:16,187 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:16,874 INFO L93 Difference]: Finished difference Result 3133 states and 4793 transitions. [2022-04-28 14:58:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:16,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 14:58:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-28 14:58:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-28 14:58:16,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-28 14:58:16,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:17,153 INFO L225 Difference]: With dead ends: 3133 [2022-04-28 14:58:17,153 INFO L226 Difference]: Without dead ends: 2123 [2022-04-28 14:58:17,154 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-28 14:58:17,155 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:17,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-28 14:58:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-04-28 14:58:17,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:17,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:17,303 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:17,305 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:17,413 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-28 14:58:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-28 14:58:17,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:17,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:17,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-28 14:58:17,419 INFO L87 Difference]: Start difference. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-28 14:58:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:17,528 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-28 14:58:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-28 14:58:17,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:17,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:17,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:17,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-04-28 14:58:17,721 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-04-28 14:58:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:17,722 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-04-28 14:58:17,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:17,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2121 states and 3207 transitions. [2022-04-28 14:58:20,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-04-28 14:58:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:20,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:20,749 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, 1, 1, 1, 1] [2022-04-28 14:58:20,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 14:58:20,750 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 1 times [2022-04-28 14:58:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:20,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1739400686] [2022-04-28 14:58:20,750 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 2 times [2022-04-28 14:58:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:20,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103456744] [2022-04-28 14:58:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:20,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {82363#(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(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-28 14:58:20,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-28 14:58:20,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-28 14:58:20,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {82357#true} call ULTIMATE.init(); {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:20,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {82363#(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(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-28 14:58:20,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-28 14:58:20,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {82357#true} call #t~ret16 := main(); {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {82357#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {82357#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {82357#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {82357#true} assume !(0 != ~p1~0); {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {82357#true} assume !(0 != ~p2~0); {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {82357#true} assume !(0 != ~p3~0); {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {82357#true} assume !(0 != ~p4~0); {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {82357#true} assume !(0 != ~p5~0); {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {82357#true} assume !(0 != ~p6~0); {82357#true} is VALID [2022-04-28 14:58:20,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {82357#true} assume 0 != ~p7~0;~lk7~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p7~0; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:20,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {82362#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {82358#false} is VALID [2022-04-28 14:58:20,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {82358#false} assume !false; {82358#false} is VALID [2022-04-28 14:58:20,798 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-28 14:58:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:20,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103456744] [2022-04-28 14:58:20,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103456744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:20,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:20,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:20,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:20,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1739400686] [2022-04-28 14:58:20,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1739400686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:20,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:20,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367088262] [2022-04-28 14:58:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:20,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 14:58:20,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:20,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:20,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:20,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:20,815 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:21,774 INFO L93 Difference]: Finished difference Result 3725 states and 5737 transitions. [2022-04-28 14:58:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:21,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 14:58:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 14:58:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 14:58:21,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-28 14:58:21,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:22,410 INFO L225 Difference]: With dead ends: 3725 [2022-04-28 14:58:22,410 INFO L226 Difference]: Without dead ends: 3723 [2022-04-28 14:58:22,410 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-28 14:58:22,411 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:22,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-28 14:58:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-04-28 14:58:22,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:22,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:22,617 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:22,619 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:22,974 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-28 14:58:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-28 14:58:22,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:22,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:22,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-28 14:58:22,984 INFO L87 Difference]: Start difference. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-28 14:58:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:23,343 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-28 14:58:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-28 14:58:23,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:23,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:23,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:23,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-04-28 14:58:23,778 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-04-28 14:58:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:23,778 INFO L495 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-04-28 14:58:23,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:23,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3081 states and 4519 transitions. [2022-04-28 14:58:27,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4519 edges. 4519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-04-28 14:58:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:28,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:28,002 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, 1, 1, 1, 1] [2022-04-28 14:58:28,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 14:58:28,002 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 1 times [2022-04-28 14:58:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:28,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358278438] [2022-04-28 14:58:28,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 2 times [2022-04-28 14:58:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:28,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608114798] [2022-04-28 14:58:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:28,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {103433#(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(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-28 14:58:28,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-28 14:58:28,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {103427#true} call ULTIMATE.init(); {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {103433#(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(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {103427#true} call #t~ret16 := main(); {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {103427#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {103427#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {103427#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {103427#true} assume !(0 != ~p1~0); {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {103427#true} assume !(0 != ~p2~0); {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {103427#true} assume !(0 != ~p3~0); {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {103427#true} assume !(0 != ~p4~0); {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {103427#true} assume !(0 != ~p5~0); {103427#true} is VALID [2022-04-28 14:58:28,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {103427#true} assume !(0 != ~p6~0); {103427#true} is VALID [2022-04-28 14:58:28,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {103427#true} assume !(0 != ~p7~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p10~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p1~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p2~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p3~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p4~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p5~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p6~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:28,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p7~0; {103428#false} is VALID [2022-04-28 14:58:28,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {103428#false} assume 1 != ~lk7~0; {103428#false} is VALID [2022-04-28 14:58:28,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {103428#false} assume !false; {103428#false} is VALID [2022-04-28 14:58:28,042 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-28 14:58:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:28,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608114798] [2022-04-28 14:58:28,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608114798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:28,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:28,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:28,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:28,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358278438] [2022-04-28 14:58:28,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358278438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:28,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:28,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604912606] [2022-04-28 14:58:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:28,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 14:58:28,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:28,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:28,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:28,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:28,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:28,057 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:30,605 INFO L93 Difference]: Finished difference Result 7117 states and 10473 transitions. [2022-04-28 14:58:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 14:58:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 14:58:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 14:58:30,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-28 14:58:30,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:31,393 INFO L225 Difference]: With dead ends: 7117 [2022-04-28 14:58:31,393 INFO L226 Difference]: Without dead ends: 4107 [2022-04-28 14:58:31,397 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-28 14:58:31,397 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:31,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-28 14:58:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-04-28 14:58:31,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:31,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:31,724 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:31,728 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:32,153 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-28 14:58:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-28 14:58:32,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:32,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:32,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-28 14:58:32,163 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-28 14:58:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:32,586 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-28 14:58:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-28 14:58:32,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:32,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:32,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:32,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-04-28 14:58:33,355 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-04-28 14:58:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:33,355 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-04-28 14:58:33,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:33,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 5959 transitions. [2022-04-28 14:58:39,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-04-28 14:58:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:58:39,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:39,029 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, 1, 1, 1, 1, 1] [2022-04-28 14:58:39,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 14:58:39,030 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:39,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 1 times [2022-04-28 14:58:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:39,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494884288] [2022-04-28 14:58:39,030 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 2 times [2022-04-28 14:58:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:39,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121756291] [2022-04-28 14:58:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:39,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {134103#(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(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-28 14:58:39,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {134097#true} call ULTIMATE.init(); {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {134103#(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(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {134097#true} call #t~ret16 := main(); {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {134097#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {134097#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {134097#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {134097#true} assume !(0 != ~p1~0); {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {134097#true} assume !(0 != ~p2~0); {134097#true} is VALID [2022-04-28 14:58:39,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {134097#true} assume !(0 != ~p3~0); {134097#true} is VALID [2022-04-28 14:58:39,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {134097#true} assume !(0 != ~p4~0); {134097#true} is VALID [2022-04-28 14:58:39,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {134097#true} assume !(0 != ~p5~0); {134097#true} is VALID [2022-04-28 14:58:39,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {134097#true} assume !(0 != ~p6~0); {134097#true} is VALID [2022-04-28 14:58:39,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {134097#true} assume 0 != ~p7~0;~lk7~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:39,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {134098#false} is VALID [2022-04-28 14:58:39,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {134098#false} assume 0 != ~p8~0; {134098#false} is VALID [2022-04-28 14:58:39,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {134098#false} assume 1 != ~lk8~0; {134098#false} is VALID [2022-04-28 14:58:39,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {134098#false} assume !false; {134098#false} is VALID [2022-04-28 14:58:39,068 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-28 14:58:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:39,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121756291] [2022-04-28 14:58:39,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121756291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:39,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:39,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:39,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:39,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494884288] [2022-04-28 14:58:39,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494884288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:39,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:39,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114549922] [2022-04-28 14:58:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:39,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 14:58:39,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:39,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:39,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:39,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:39,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:39,084 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:41,141 INFO L93 Difference]: Finished difference Result 6157 states and 8905 transitions. [2022-04-28 14:58:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:41,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 14:58:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 14:58:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 14:58:41,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-28 14:58:41,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:41,938 INFO L225 Difference]: With dead ends: 6157 [2022-04-28 14:58:41,938 INFO L226 Difference]: Without dead ends: 4171 [2022-04-28 14:58:41,940 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-28 14:58:41,941 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:41,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-04-28 14:58:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-04-28 14:58:42,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:42,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:42,274 INFO L74 IsIncluded]: Start isIncluded. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:42,276 INFO L87 Difference]: Start difference. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:42,709 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-28 14:58:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-28 14:58:42,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:42,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:42,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-28 14:58:42,720 INFO L87 Difference]: Start difference. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-28 14:58:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:43,153 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-28 14:58:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-28 14:58:43,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:43,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:43,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:43,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-04-28 14:58:43,922 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-04-28 14:58:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:43,922 INFO L495 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-04-28 14:58:43,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:43,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4169 states and 5959 transitions. [2022-04-28 14:58:49,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-04-28 14:58:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:58:49,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:49,645 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, 1, 1, 1, 1, 1] [2022-04-28 14:58:49,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 14:58:49,645 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 1 times [2022-04-28 14:58:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:49,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851594327] [2022-04-28 14:58:49,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 2 times [2022-04-28 14:58:49,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:49,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583865216] [2022-04-28 14:58:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:49,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {163109#(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(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-28 14:58:49,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {163103#true} call ULTIMATE.init(); {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {163109#(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(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {163103#true} call #t~ret16 := main(); {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {163103#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {163103#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {163103#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {163103#true} assume !(0 != ~p1~0); {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {163103#true} assume !(0 != ~p2~0); {163103#true} is VALID [2022-04-28 14:58:49,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {163103#true} assume !(0 != ~p3~0); {163103#true} is VALID [2022-04-28 14:58:49,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {163103#true} assume !(0 != ~p4~0); {163103#true} is VALID [2022-04-28 14:58:49,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {163103#true} assume !(0 != ~p5~0); {163103#true} is VALID [2022-04-28 14:58:49,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {163103#true} assume !(0 != ~p6~0); {163103#true} is VALID [2022-04-28 14:58:49,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {163103#true} assume !(0 != ~p7~0); {163103#true} is VALID [2022-04-28 14:58:49,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {163103#true} assume 0 != ~p8~0;~lk8~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p8~0; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:49,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {163108#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {163104#false} is VALID [2022-04-28 14:58:49,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {163104#false} assume !false; {163104#false} is VALID [2022-04-28 14:58:49,676 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-28 14:58:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:49,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583865216] [2022-04-28 14:58:49,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583865216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:49,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:49,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:49,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:49,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851594327] [2022-04-28 14:58:49,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851594327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:49,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:49,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197397695] [2022-04-28 14:58:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 14:58:49,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:49,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:49,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:49,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:49,693 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:52,525 INFO L93 Difference]: Finished difference Result 7181 states and 10441 transitions. [2022-04-28 14:58:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 14:58:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 14:58:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 14:58:52,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 14:58:52,594 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-28 14:58:54,695 INFO L225 Difference]: With dead ends: 7181 [2022-04-28 14:58:54,695 INFO L226 Difference]: Without dead ends: 7179 [2022-04-28 14:58:54,696 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-28 14:58:54,697 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:54,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-04-28 14:58:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-04-28 14:58:55,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:55,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:55,149 INFO L74 IsIncluded]: Start isIncluded. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:55,155 INFO L87 Difference]: Start difference. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:56,502 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-28 14:58:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-28 14:58:56,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:56,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:56,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-28 14:58:56,519 INFO L87 Difference]: Start difference. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-28 14:58:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:57,866 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-28 14:58:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-28 14:58:57,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:57,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:57,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:57,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-04-28 14:58:59,583 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-04-28 14:58:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:59,583 INFO L495 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-04-28 14:58:59,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:59,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6153 states and 8519 transitions. [2022-04-28 14:59:07,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8519 edges. 8519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-04-28 14:59:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:59:07,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:07,883 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, 1, 1, 1, 1, 1] [2022-04-28 14:59:07,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 14:59:07,883 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 1 times [2022-04-28 14:59:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:07,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432719178] [2022-04-28 14:59:07,883 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 2 times [2022-04-28 14:59:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004499113] [2022-04-28 14:59:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:07,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {204147#(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(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {204141#true} call ULTIMATE.init(); {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {204147#(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(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {204141#true} call #t~ret16 := main(); {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {204141#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {204141#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {204141#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {204141#true} assume !(0 != ~p1~0); {204141#true} is VALID [2022-04-28 14:59:07,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {204141#true} assume !(0 != ~p2~0); {204141#true} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {204141#true} assume !(0 != ~p3~0); {204141#true} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {204141#true} assume !(0 != ~p4~0); {204141#true} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {204141#true} assume !(0 != ~p5~0); {204141#true} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {204141#true} assume !(0 != ~p6~0); {204141#true} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {204141#true} assume !(0 != ~p7~0); {204141#true} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {204141#true} assume !(0 != ~p8~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p10~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p1~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p2~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p3~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p4~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p5~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p6~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p7~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 14:59:07,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p8~0; {204142#false} is VALID [2022-04-28 14:59:07,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {204142#false} assume 1 != ~lk8~0; {204142#false} is VALID [2022-04-28 14:59:07,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {204142#false} assume !false; {204142#false} is VALID [2022-04-28 14:59:07,919 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-28 14:59:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:07,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004499113] [2022-04-28 14:59:07,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004499113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:07,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:07,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:07,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:07,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432719178] [2022-04-28 14:59:07,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432719178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:07,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:07,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:07,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545973210] [2022-04-28 14:59:07,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:07,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 14:59:07,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:07,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:07,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:07,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:07,935 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:17,192 INFO L93 Difference]: Finished difference Result 14093 states and 19529 transitions. [2022-04-28 14:59:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:17,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 14:59:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-28 14:59:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-28 14:59:17,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-28 14:59:17,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:19,918 INFO L225 Difference]: With dead ends: 14093 [2022-04-28 14:59:19,919 INFO L226 Difference]: Without dead ends: 8075 [2022-04-28 14:59:19,925 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-28 14:59:19,925 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:59:19,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:59:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-04-28 14:59:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-04-28 14:59:20,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:20,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:20,523 INFO L74 IsIncluded]: Start isIncluded. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:20,531 INFO L87 Difference]: Start difference. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:22,170 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-28 14:59:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-28 14:59:22,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:22,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:22,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-28 14:59:22,193 INFO L87 Difference]: Start difference. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-28 14:59:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:23,858 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-28 14:59:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-28 14:59:23,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:23,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:23,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:23,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-04-28 14:59:26,629 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-04-28 14:59:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:26,629 INFO L495 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-04-28 14:59:26,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:26,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8073 states and 11015 transitions. [2022-04-28 14:59:37,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-04-28 14:59:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:59:37,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:59:37,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 14:59:37,532 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 1 times [2022-04-28 14:59:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:37,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1673171182] [2022-04-28 14:59:37,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 2 times [2022-04-28 14:59:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:37,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579685141] [2022-04-28 14:59:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:37,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {264641#(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(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-28 14:59:37,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-28 14:59:37,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {264635#true} call ULTIMATE.init(); {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {264641#(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(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {264635#true} call #t~ret16 := main(); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {264635#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {264635#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {264635#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {264635#true} assume !(0 != ~p1~0); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {264635#true} assume !(0 != ~p2~0); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {264635#true} assume !(0 != ~p3~0); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {264635#true} assume !(0 != ~p4~0); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {264635#true} assume !(0 != ~p5~0); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {264635#true} assume !(0 != ~p6~0); {264635#true} is VALID [2022-04-28 14:59:37,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {264635#true} assume !(0 != ~p7~0); {264635#true} is VALID [2022-04-28 14:59:37,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {264635#true} assume 0 != ~p8~0;~lk8~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:37,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {264636#false} is VALID [2022-04-28 14:59:37,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {264636#false} assume 0 != ~p9~0; {264636#false} is VALID [2022-04-28 14:59:37,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {264636#false} assume 1 != ~lk9~0; {264636#false} is VALID [2022-04-28 14:59:37,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {264636#false} assume !false; {264636#false} is VALID [2022-04-28 14:59:37,584 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-28 14:59:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579685141] [2022-04-28 14:59:37,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579685141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:37,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:37,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:37,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1673171182] [2022-04-28 14:59:37,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1673171182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:37,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:37,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439642643] [2022-04-28 14:59:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:37,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 14:59:37,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:37,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:37,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:37,600 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:44,040 INFO L93 Difference]: Finished difference Result 12109 states and 16457 transitions. [2022-04-28 14:59:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:44,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 14:59:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 14:59:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 14:59:44,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-28 14:59:44,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:46,875 INFO L225 Difference]: With dead ends: 12109 [2022-04-28 14:59:46,875 INFO L226 Difference]: Without dead ends: 8203 [2022-04-28 14:59:46,880 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-28 14:59:46,881 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:59:46,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 102 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:59:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-04-28 14:59:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-04-28 14:59:47,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:47,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:47,519 INFO L74 IsIncluded]: Start isIncluded. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:47,527 INFO L87 Difference]: Start difference. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:49,149 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-28 14:59:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-28 14:59:49,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:49,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:49,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-28 14:59:49,175 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-28 14:59:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:50,822 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-28 14:59:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-28 14:59:50,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:50,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:50,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:50,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-04-28 14:59:53,720 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-04-28 14:59:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:53,720 INFO L495 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-04-28 14:59:53,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:53,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 11015 transitions. [2022-04-28 15:00:04,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-04-28 15:00:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:00:04,840 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:04,840 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, 1, 1, 1, 1, 1, 1] [2022-04-28 15:00:04,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:00:04,840 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:04,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 1 times [2022-04-28 15:00:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:04,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128836657] [2022-04-28 15:00:04,841 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:04,841 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 2 times [2022-04-28 15:00:04,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:04,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541907920] [2022-04-28 15:00:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:04,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {321679#(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(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-28 15:00:04,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-28 15:00:04,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-28 15:00:04,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {321673#true} call ULTIMATE.init(); {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {321679#(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(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {321673#true} call #t~ret16 := main(); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {321673#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {321673#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {321673#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {321673#true} assume !(0 != ~p1~0); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {321673#true} assume !(0 != ~p2~0); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {321673#true} assume !(0 != ~p3~0); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {321673#true} assume !(0 != ~p4~0); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {321673#true} assume !(0 != ~p5~0); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {321673#true} assume !(0 != ~p6~0); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {321673#true} assume !(0 != ~p7~0); {321673#true} is VALID [2022-04-28 15:00:04,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {321673#true} assume !(0 != ~p8~0); {321673#true} is VALID [2022-04-28 15:00:04,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {321673#true} assume 0 != ~p9~0;~lk9~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p9~0; {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 15:00:04,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {321678#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {321674#false} is VALID [2022-04-28 15:00:04,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {321674#false} assume !false; {321674#false} is VALID [2022-04-28 15:00:04,892 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-28 15:00:04,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:04,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541907920] [2022-04-28 15:00:04,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541907920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:04,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:04,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:04,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:04,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128836657] [2022-04-28 15:00:04,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128836657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:04,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:04,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212846613] [2022-04-28 15:00:04,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 15:00:04,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:04,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:04,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:04,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:04,911 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:15,084 INFO L93 Difference]: Finished difference Result 13837 states and 18825 transitions. [2022-04-28 15:00:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 15:00:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 15:00:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 15:00:15,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 15:00:15,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:23,604 INFO L225 Difference]: With dead ends: 13837 [2022-04-28 15:00:23,604 INFO L226 Difference]: Without dead ends: 13835 [2022-04-28 15:00:23,607 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-28 15:00:23,607 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:23,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-04-28 15:00:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-04-28 15:00:24,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:24,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,605 INFO L74 IsIncluded]: Start isIncluded. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,621 INFO L87 Difference]: Start difference. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:29,818 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-28 15:00:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-28 15:00:29,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:29,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:29,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-28 15:00:29,857 INFO L87 Difference]: Start difference. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-28 15:00:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:35,177 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-28 15:00:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-28 15:00:35,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:35,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:35,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:35,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-04-28 15:00:42,193 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-04-28 15:00:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:42,193 INFO L495 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-04-28 15:00:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:42,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12297 states and 16007 transitions. [2022-04-28 15:00:58,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16007 edges. 16007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-04-28 15:00:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:00:58,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:58,525 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, 1, 1, 1, 1, 1, 1] [2022-04-28 15:00:58,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:00:58,525 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 1 times [2022-04-28 15:00:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [609556253] [2022-04-28 15:00:58,526 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 2 times [2022-04-28 15:00:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:58,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314124747] [2022-04-28 15:00:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:58,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {401629#(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(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-28 15:00:58,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-28 15:00:58,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-28 15:00:58,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {401623#true} call ULTIMATE.init(); {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:58,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {401629#(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(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-28 15:00:58,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-28 15:00:58,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-28 15:00:58,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {401623#true} call #t~ret16 := main(); {401623#true} is VALID [2022-04-28 15:00:58,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {401623#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {401623#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {401623#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {401623#true} assume !(0 != ~p1~0); {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {401623#true} assume !(0 != ~p2~0); {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {401623#true} assume !(0 != ~p3~0); {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {401623#true} assume !(0 != ~p4~0); {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {401623#true} assume !(0 != ~p5~0); {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {401623#true} assume !(0 != ~p6~0); {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {401623#true} assume !(0 != ~p7~0); {401623#true} is VALID [2022-04-28 15:00:58,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {401623#true} assume !(0 != ~p8~0); {401623#true} is VALID [2022-04-28 15:00:58,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {401623#true} assume !(0 != ~p9~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p10~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p1~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p2~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p3~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p4~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p5~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p6~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p7~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p8~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:58,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p9~0; {401624#false} is VALID [2022-04-28 15:00:58,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {401624#false} assume 1 != ~lk9~0; {401624#false} is VALID [2022-04-28 15:00:58,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {401624#false} assume !false; {401624#false} is VALID [2022-04-28 15:00:58,570 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-28 15:00:58,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:58,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314124747] [2022-04-28 15:00:58,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314124747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:58,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:58,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:58,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:58,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [609556253] [2022-04-28 15:00:58,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [609556253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:58,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:58,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:58,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788789611] [2022-04-28 15:00:58,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 15:00:58,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:58,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:58,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:58,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:58,587 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:54,147 INFO L93 Difference]: Finished difference Result 27917 states and 36233 transitions. [2022-04-28 15:01:54,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:54,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 15:01:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 15:01:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 15:01:54,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-28 15:01:54,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:05,038 INFO L225 Difference]: With dead ends: 27917 [2022-04-28 15:02:05,038 INFO L226 Difference]: Without dead ends: 15883 [2022-04-28 15:02:05,052 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-28 15:02:05,053 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:05,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-04-28 15:02:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-04-28 15:02:06,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:06,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:06,348 INFO L74 IsIncluded]: Start isIncluded. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:06,365 INFO L87 Difference]: Start difference. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:12,672 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-28 15:02:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-28 15:02:12,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:12,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:12,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-28 15:02:12,716 INFO L87 Difference]: Start difference. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-28 15:02:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:19,041 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-28 15:02:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-28 15:02:19,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:19,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:19,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:19,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-04-28 15:02:30,246 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-04-28 15:02:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:30,247 INFO L495 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-04-28 15:02:30,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:30,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15881 states and 20231 transitions. [2022-04-28 15:02:50,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-04-28 15:02:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:02:50,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:50,744 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:02:50,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:02:50,744 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 1 times [2022-04-28 15:02:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269344827] [2022-04-28 15:02:50,744 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 2 times [2022-04-28 15:02:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:50,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721415778] [2022-04-28 15:02:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:50,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {521003#(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(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-28 15:02:50,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-28 15:02:50,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {520997#true} call ULTIMATE.init(); {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:50,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {521003#(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(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {520997#true} call #t~ret16 := main(); {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {520997#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {520997#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {520997#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {520997#true} assume !(0 != ~p1~0); {520997#true} is VALID [2022-04-28 15:02:50,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {520997#true} assume !(0 != ~p2~0); {520997#true} is VALID [2022-04-28 15:02:50,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {520997#true} assume !(0 != ~p3~0); {520997#true} is VALID [2022-04-28 15:02:50,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {520997#true} assume !(0 != ~p4~0); {520997#true} is VALID [2022-04-28 15:02:50,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {520997#true} assume !(0 != ~p5~0); {520997#true} is VALID [2022-04-28 15:02:50,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {520997#true} assume !(0 != ~p6~0); {520997#true} is VALID [2022-04-28 15:02:50,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {520997#true} assume !(0 != ~p7~0); {520997#true} is VALID [2022-04-28 15:02:50,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {520997#true} assume !(0 != ~p8~0); {520997#true} is VALID [2022-04-28 15:02:50,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {520997#true} assume 0 != ~p9~0;~lk9~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {521002#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:02:50,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {520998#false} is VALID [2022-04-28 15:02:50,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {520998#false} assume 0 != ~p10~0; {520998#false} is VALID [2022-04-28 15:02:50,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {520998#false} assume 1 != ~lk10~0; {520998#false} is VALID [2022-04-28 15:02:50,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {520998#false} assume !false; {520998#false} is VALID [2022-04-28 15:02:50,782 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-28 15:02:50,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721415778] [2022-04-28 15:02:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721415778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:50,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:50,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:50,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:50,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269344827] [2022-04-28 15:02:50,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269344827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:50,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:50,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:50,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241560025] [2022-04-28 15:02:50,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 15:02:50,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:50,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:50,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:50,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:50,799 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:18,276 INFO L93 Difference]: Finished difference Result 23821 states and 30217 transitions. [2022-04-28 15:03:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:03:18,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 15:03:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:03:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 15:03:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 15:03:18,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-28 15:03:18,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:29,311 INFO L225 Difference]: With dead ends: 23821 [2022-04-28 15:03:29,311 INFO L226 Difference]: Without dead ends: 16139 [2022-04-28 15:03:29,321 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-28 15:03:29,321 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:03:29,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:03:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-04-28 15:03:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-04-28 15:03:30,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:03:30,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:30,617 INFO L74 IsIncluded]: Start isIncluded. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:30,638 INFO L87 Difference]: Start difference. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:37,491 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-28 15:03:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-28 15:03:37,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:37,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:37,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-28 15:03:37,547 INFO L87 Difference]: Start difference. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-28 15:03:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:43,889 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-28 15:03:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-28 15:03:43,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:43,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:43,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:03:43,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:03:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-04-28 15:03:55,388 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-04-28 15:03:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:03:55,388 INFO L495 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-04-28 15:03:55,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:55,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16137 states and 20231 transitions. [2022-04-28 15:04:16,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-04-28 15:04:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:04:16,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:04:16,063 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:04:16,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:04:16,064 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:04:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:04:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 1 times [2022-04-28 15:04:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:16,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1681031002] [2022-04-28 15:04:16,064 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:04:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 2 times [2022-04-28 15:04:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:04:16,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137224813] [2022-04-28 15:04:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:04:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:04:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:04:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:16,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {633209#(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(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-28 15:04:16,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {633203#true} call ULTIMATE.init(); {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {633209#(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(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {633203#true} call #t~ret16 := main(); {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {633203#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {633203#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {633203#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;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {633203#true} assume !(0 != ~p1~0); {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {633203#true} assume !(0 != ~p2~0); {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {633203#true} assume !(0 != ~p3~0); {633203#true} is VALID [2022-04-28 15:04:16,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {633203#true} assume !(0 != ~p4~0); {633203#true} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {633203#true} assume !(0 != ~p5~0); {633203#true} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {633203#true} assume !(0 != ~p6~0); {633203#true} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {633203#true} assume !(0 != ~p7~0); {633203#true} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {633203#true} assume !(0 != ~p8~0); {633203#true} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {633203#true} assume !(0 != ~p9~0); {633203#true} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {633203#true} assume !(0 != ~p10~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p1~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p2~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p3~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p4~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p5~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p6~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p7~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p8~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p9~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 15:04:16,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p10~0; {633204#false} is VALID [2022-04-28 15:04:16,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {633204#false} assume 1 != ~lk10~0; {633204#false} is VALID [2022-04-28 15:04:16,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {633204#false} assume !false; {633204#false} is VALID [2022-04-28 15:04:16,104 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-28 15:04:16,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:04:16,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137224813] [2022-04-28 15:04:16,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137224813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:16,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:16,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:04:16,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:04:16,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1681031002] [2022-04-28 15:04:16,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1681031002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:16,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:16,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:04:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861993058] [2022-04-28 15:04:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:04:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 15:04:16,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:04:16,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:04:16,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:16,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:04:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:04:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:04:16,120 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:09:14,496 INFO L93 Difference]: Finished difference Result 46861 states and 57609 transitions. [2022-04-28 15:09:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:09:14,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 15:09:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:09:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 15:09:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 15:09:14,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-28 15:09:14,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:09:58,914 INFO L225 Difference]: With dead ends: 46861 [2022-04-28 15:09:58,915 INFO L226 Difference]: Without dead ends: 31243 [2022-04-28 15:09:58,936 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-28 15:09:58,936 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:09:58,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 93 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:09:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2022-04-28 15:10:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2022-04-28 15:10:01,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:10:01,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:10:01,637 INFO L74 IsIncluded]: Start isIncluded. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:10:01,673 INFO L87 Difference]: Start difference. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:10:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:10:28,225 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-28 15:10:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-28 15:10:28,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:10:28,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:10:28,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 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 31243 states. [2022-04-28 15:10:28,315 INFO L87 Difference]: Start difference. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 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 31243 states. [2022-04-28 15:10:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:10:55,645 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-28 15:10:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-28 15:10:55,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:10:55,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:10:55,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:10:55,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:10:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:11:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 37383 transitions. [2022-04-28 15:11:59,978 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 37383 transitions. Word has length 31 [2022-04-28 15:11:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:11:59,978 INFO L495 AbstractCegarLoop]: Abstraction has 31241 states and 37383 transitions. [2022-04-28 15:11:59,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:11:59,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31241 states and 37383 transitions.