/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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:01:48,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:01:48,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:01:49,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:01:49,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:01:49,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:01:49,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:01:49,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:01:49,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:01:49,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:01:49,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:01:49,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:01:49,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:01:49,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:01:49,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:01:49,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:01:49,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:01:49,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:01:49,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:01:49,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:01:49,056 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:01:49,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:01:49,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:01:49,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:01:49,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:01:49,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:01:49,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:01:49,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:01:49,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:01:49,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:01:49,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:01:49,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:01:49,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:01:49,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:01:49,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:01:49,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:01:49,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:01:49,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:01:49,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:01:49,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:01:49,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:01:49,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:01:49,082 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 15:01:49,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:01:49,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:01:49,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:01:49,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:01:49,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:01:49,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:01:49,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:01:49,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:01:49,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:01:49,092 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:01:49,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:01:49,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:01:49,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:01:49,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:01:49,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:01:49,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:49,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:01:49,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:01:49,094 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:01:49,094 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:01:49,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:01:49,094 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:01:49,095 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 15:01:49,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:01:49,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:01:49,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:01:49,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:01:49,392 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:01:49,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-04-28 15:01:49,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d18f15ef/cdd7d65528ba4e368107e40944505329/FLAGe17492656 [2022-04-28 15:01:49,824 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:01:49,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-28 15:01:49,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d18f15ef/cdd7d65528ba4e368107e40944505329/FLAGe17492656 [2022-04-28 15:01:50,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d18f15ef/cdd7d65528ba4e368107e40944505329 [2022-04-28 15:01:50,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:01:50,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:01:50,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:50,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:01:50,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:01:50,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b165e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50, skipping insertion in model container [2022-04-28 15:01:50,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:01:50,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:01:50,466 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_9.c[3555,3568] [2022-04-28 15:01:50,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:50,476 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:01:50,511 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_9.c[3555,3568] [2022-04-28 15:01:50,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:50,523 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:01:50,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50 WrapperNode [2022-04-28 15:01:50,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:50,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:01:50,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:01:50,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:01:50,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:01:50,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:01:50,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:01:50,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:01:50,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (1/1) ... [2022-04-28 15:01:50,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:01:50,587 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 15:01:50,589 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 15:01:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:01:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:01:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:01:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:01:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:01:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:01:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:01:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:01:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:01:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:01:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:01:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:01:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:01:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:01:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:01:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:01:50,679 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:01:50,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:01:50,849 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:01:50,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:01:50,855 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:01:50,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:50 BoogieIcfgContainer [2022-04-28 15:01:50,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:01:50,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:01:50,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:01:50,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:01:50,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:01:50" (1/3) ... [2022-04-28 15:01:50,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346c7430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:50, skipping insertion in model container [2022-04-28 15:01:50,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:50" (2/3) ... [2022-04-28 15:01:50,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346c7430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:50, skipping insertion in model container [2022-04-28 15:01:50,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:50" (3/3) ... [2022-04-28 15:01:50,864 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-04-28 15:01:50,895 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:01:50,895 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:01:50,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:01:50,968 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@2266fded, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fddb5e0 [2022-04-28 15:01:50,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:01:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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 15:01:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:50,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:50,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:50,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 1 times [2022-04-28 15:01:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:50,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039459264] [2022-04-28 15:01:51,007 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 2 times [2022-04-28 15:01:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:51,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230723299] [2022-04-28 15:01:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:51,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45#true} is VALID [2022-04-28 15:01:51,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-28 15:01:51,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-28 15:01:51,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:51,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45#true} is VALID [2022-04-28 15:01:51,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-28 15:01:51,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-28 15:01:51,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret14 := main(); {45#true} is VALID [2022-04-28 15:01:51,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#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;havoc ~cond~0; {45#true} is VALID [2022-04-28 15:01:51,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {45#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {45#true} is VALID [2022-04-28 15:01:51,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#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; {45#true} is VALID [2022-04-28 15:01:51,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#true} assume 0 != ~p1~0;~lk1~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p1~0; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:51,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {46#false} is VALID [2022-04-28 15:01:51,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-04-28 15:01:51,335 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:01:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:51,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230723299] [2022-04-28 15:01:51,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230723299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:51,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:51,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:51,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:51,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039459264] [2022-04-28 15:01:51,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039459264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:51,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:51,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467655106] [2022-04-28 15:01:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:51,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:51,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:51,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:51,425 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:51,791 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2022-04-28 15:01:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:51,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:51,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 15:01:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 15:01:51,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 15:01:51,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:51,961 INFO L225 Difference]: With dead ends: 82 [2022-04-28 15:01:51,961 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 15:01:51,964 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:01:51,966 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 83 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:51,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 83 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:01:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 15:01:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-28 15:01:51,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:51,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states 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:52,000 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states 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:52,001 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states 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:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:52,005 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-28 15:01:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-28 15:01:52,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:52,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:52,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 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 67 states. [2022-04-28 15:01:52,007 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 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 67 states. [2022-04-28 15:01:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:52,012 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-28 15:01:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-28 15:01:52,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:52,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:52,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:52,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states 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:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-28 15:01:52,017 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-28 15:01:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:52,017 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-28 15:01:52,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:52,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 82 transitions. [2022-04-28 15:01:52,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-28 15:01:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:52,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:52,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:52,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:01:52,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 1 times [2022-04-28 15:01:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:52,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573966653] [2022-04-28 15:01:52,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 2 times [2022-04-28 15:01:52,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:52,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943932174] [2022-04-28 15:01:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:52,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-28 15:01:52,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 15:01:52,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-28 15:01:52,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:52,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-28 15:01:52,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 15:01:52,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-28 15:01:52,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret14 := main(); {449#true} is VALID [2022-04-28 15:01:52,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#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;havoc ~cond~0; {449#true} is VALID [2022-04-28 15:01:52,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {449#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {449#true} is VALID [2022-04-28 15:01:52,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#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; {449#true} is VALID [2022-04-28 15:01:52,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#true} assume !(0 != ~p1~0); {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(= main_~p1~0 0)} assume !(0 != ~p2~0); {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:52,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p1~0; {450#false} is VALID [2022-04-28 15:01:52,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} assume 1 != ~lk1~0; {450#false} is VALID [2022-04-28 15:01:52,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-28 15:01:52,188 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:01:52,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:52,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943932174] [2022-04-28 15:01:52,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943932174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:52,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:52,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:52,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:52,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573966653] [2022-04-28 15:01:52,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573966653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:52,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:52,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160119084] [2022-04-28 15:01:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:52,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:52,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:52,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:52,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:52,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:52,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:52,210 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:52,447 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2022-04-28 15:01:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 15:01:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 15:01:52,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-28 15:01:52,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:52,611 INFO L225 Difference]: With dead ends: 108 [2022-04-28 15:01:52,612 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 15:01:52,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 15:01:52,616 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:52,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:01:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 15:01:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-28 15:01:52,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:52,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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:52,634 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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:52,635 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:52,638 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-28 15:01:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-28 15:01:52,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:52,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:52,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 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 67 states. [2022-04-28 15:01:52,640 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 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 67 states. [2022-04-28 15:01:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:52,643 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-28 15:01:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-28 15:01:52,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:52,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:52,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:52,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-28 15:01:52,647 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-28 15:01:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:52,648 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-28 15:01:52,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:52,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 114 transitions. [2022-04-28 15:01:52,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-28 15:01:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:52,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:52,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:52,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:01:52,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 1 times [2022-04-28 15:01:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:52,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033577396] [2022-04-28 15:01:52,766 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 2 times [2022-04-28 15:01:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247360494] [2022-04-28 15:01:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:52,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {941#true} is VALID [2022-04-28 15:01:52,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-28 15:01:52,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-28 15:01:52,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:52,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {941#true} is VALID [2022-04-28 15:01:52,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-28 15:01:52,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-28 15:01:52,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret14 := main(); {941#true} is VALID [2022-04-28 15:01:52,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#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;havoc ~cond~0; {941#true} is VALID [2022-04-28 15:01:52,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {941#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {941#true} is VALID [2022-04-28 15:01:52,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {941#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; {941#true} is VALID [2022-04-28 15:01:52,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#true} assume 0 != ~p1~0;~lk1~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {946#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:52,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {946#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {942#false} is VALID [2022-04-28 15:01:52,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume 0 != ~p2~0; {942#false} is VALID [2022-04-28 15:01:52,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {942#false} assume 1 != ~lk2~0; {942#false} is VALID [2022-04-28 15:01:52,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-28 15:01:52,846 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:01:52,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:52,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247360494] [2022-04-28 15:01:52,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247360494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:52,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:52,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:52,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:52,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033577396] [2022-04-28 15:01:52,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033577396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:52,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:52,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:52,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955593483] [2022-04-28 15:01:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:52,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:52,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:52,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:52,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:52,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:52,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:52,867 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:53,033 INFO L93 Difference]: Finished difference Result 100 states and 172 transitions. [2022-04-28 15:01:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:53,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 15:01:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 15:01:53,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-28 15:01:53,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:53,177 INFO L225 Difference]: With dead ends: 100 [2022-04-28 15:01:53,178 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 15:01:53,179 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:01:53,181 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:53,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 15:01:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-28 15:01:53,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:53,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states 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:53,202 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states 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:53,203 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states 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:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:53,205 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-28 15:01:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-28 15:01:53,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:53,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:53,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 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 70 states. [2022-04-28 15:01:53,211 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 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 70 states. [2022-04-28 15:01:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:53,216 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-28 15:01:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-28 15:01:53,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:53,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:53,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:53,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states 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:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-28 15:01:53,221 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-28 15:01:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:53,223 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-28 15:01:53,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 116 transitions. [2022-04-28 15:01:53,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-28 15:01:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:53,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:53,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:53,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:01:53,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 1 times [2022-04-28 15:01:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:53,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217853798] [2022-04-28 15:01:53,334 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 2 times [2022-04-28 15:01:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:53,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030206800] [2022-04-28 15:01:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:53,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {1435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1429#true} is VALID [2022-04-28 15:01:53,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-28 15:01:53,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-28 15:01:53,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {1429#true} call ULTIMATE.init(); {1435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:53,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1429#true} is VALID [2022-04-28 15:01:53,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-28 15:01:53,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-28 15:01:53,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret14 := main(); {1429#true} is VALID [2022-04-28 15:01:53,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {1429#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;havoc ~cond~0; {1429#true} is VALID [2022-04-28 15:01:53,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {1429#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {1429#true} is VALID [2022-04-28 15:01:53,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {1429#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; {1429#true} is VALID [2022-04-28 15:01:53,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {1429#true} assume !(0 != ~p1~0); {1429#true} is VALID [2022-04-28 15:01:53,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {1429#true} assume !(0 != ~p2~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:53,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p2~0; {1430#false} is VALID [2022-04-28 15:01:53,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#false} assume 1 != ~lk2~0; {1430#false} is VALID [2022-04-28 15:01:53,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2022-04-28 15:01:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:53,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030206800] [2022-04-28 15:01:53,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030206800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:53,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:53,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:53,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:53,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217853798] [2022-04-28 15:01:53,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217853798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:53,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:53,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507250397] [2022-04-28 15:01:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:53,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:53,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:53,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:53,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:53,455 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:53,639 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2022-04-28 15:01:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:53,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 15:01:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 15:01:53,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-28 15:01:53,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:53,780 INFO L225 Difference]: With dead ends: 184 [2022-04-28 15:01:53,780 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 15:01:53,781 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:01:53,788 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:53,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 73 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 15:01:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-28 15:01:53,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:53,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states 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:53,815 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states 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:53,816 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states 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:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:53,820 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-28 15:01:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-28 15:01:53,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:53,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:53,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-28 15:01:53,822 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-28 15:01:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:53,827 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-28 15:01:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-28 15:01:53,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:53,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:53,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:53,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states 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:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2022-04-28 15:01:53,833 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2022-04-28 15:01:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:53,833 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2022-04-28 15:01:53,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:53,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 213 transitions. [2022-04-28 15:01:54,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2022-04-28 15:01:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:54,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:54,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:01:54,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 1 times [2022-04-28 15:01:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:54,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969094813] [2022-04-28 15:01:54,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 2 times [2022-04-28 15:01:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:54,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005144836] [2022-04-28 15:01:54,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:54,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {2311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2305#true} is VALID [2022-04-28 15:01:54,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-28 15:01:54,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-28 15:01:54,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:54,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {2311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2305#true} is VALID [2022-04-28 15:01:54,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-28 15:01:54,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-28 15:01:54,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret14 := main(); {2305#true} is VALID [2022-04-28 15:01:54,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {2305#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;havoc ~cond~0; {2305#true} is VALID [2022-04-28 15:01:54,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {2305#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {2305#true} is VALID [2022-04-28 15:01:54,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {2305#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; {2305#true} is VALID [2022-04-28 15:01:54,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {2305#true} assume !(0 != ~p1~0); {2305#true} is VALID [2022-04-28 15:01:54,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#true} assume 0 != ~p2~0;~lk2~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {2310#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:54,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {2310#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2306#false} is VALID [2022-04-28 15:01:54,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2022-04-28 15:01:54,140 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:01:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:54,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005144836] [2022-04-28 15:01:54,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005144836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:54,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:54,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:54,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:54,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969094813] [2022-04-28 15:01:54,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969094813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:54,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:54,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633923536] [2022-04-28 15:01:54,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:54,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:54,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:54,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:54,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:54,157 INFO L87 Difference]: Start difference. First operand 123 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:54,322 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2022-04-28 15:01:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:54,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-28 15:01:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-28 15:01:54,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-28 15:01:54,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:54,419 INFO L225 Difference]: With dead ends: 159 [2022-04-28 15:01:54,419 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 15:01:54,419 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:01:54,420 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:54,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 15:01:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2022-04-28 15:01:54,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:54,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states 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,442 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states 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,442 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states 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,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:54,448 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-28 15:01:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-28 15:01:54,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:54,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:54,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 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 157 states. [2022-04-28 15:01:54,449 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 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 157 states. [2022-04-28 15:01:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:54,455 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-28 15:01:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-28 15:01:54,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:54,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:54,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:54,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states 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,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-28 15:01:54,461 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-28 15:01:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:54,462 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-28 15:01:54,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 211 transitions. [2022-04-28 15:01:54,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-28 15:01:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:54,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:54,668 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 15:01:54,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:01:54,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 1 times [2022-04-28 15:01:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:54,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570309136] [2022-04-28 15:01:54,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 2 times [2022-04-28 15:01:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:54,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828178766] [2022-04-28 15:01:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:54,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {3201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3195#true} is VALID [2022-04-28 15:01:54,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-28 15:01:54,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-28 15:01:54,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {3195#true} call ULTIMATE.init(); {3201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:54,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {3201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3195#true} is VALID [2022-04-28 15:01:54,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-28 15:01:54,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-28 15:01:54,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret14 := main(); {3195#true} is VALID [2022-04-28 15:01:54,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {3195#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;havoc ~cond~0; {3195#true} is VALID [2022-04-28 15:01:54,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {3195#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {3195#true} is VALID [2022-04-28 15:01:54,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {3195#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; {3195#true} is VALID [2022-04-28 15:01:54,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#true} assume !(0 != ~p1~0); {3195#true} is VALID [2022-04-28 15:01:54,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {3195#true} assume !(0 != ~p2~0); {3195#true} is VALID [2022-04-28 15:01:54,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {3195#true} assume 0 != ~p3~0;~lk3~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:54,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {3200#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3196#false} is VALID [2022-04-28 15:01:54,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2022-04-28 15:01:54,763 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:01:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:54,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828178766] [2022-04-28 15:01:54,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828178766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:54,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:54,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:54,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:54,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570309136] [2022-04-28 15:01:54,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570309136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:54,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:54,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794462561] [2022-04-28 15:01:54,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:54,765 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 15:01:54,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:54,765 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 15:01:54,780 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 15:01:54,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:54,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:54,782 INFO L87 Difference]: Start difference. First operand 123 states and 211 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 15:01:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:54,977 INFO L93 Difference]: Finished difference Result 227 states and 395 transitions. [2022-04-28 15:01:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:54,977 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 15:01:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:54,978 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 15:01:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 15:01:54,980 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 15:01:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 15:01:54,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 15:01:55,072 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:01:55,078 INFO L225 Difference]: With dead ends: 227 [2022-04-28 15:01:55,078 INFO L226 Difference]: Without dead ends: 225 [2022-04-28 15:01:55,079 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:01:55,079 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:55,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-28 15:01:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2022-04-28 15:01:55,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:55,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states 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:55,105 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states 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:55,105 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states 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:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:55,112 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-28 15:01:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-28 15:01:55,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:55,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:55,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 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 225 states. [2022-04-28 15:01:55,114 INFO L87 Difference]: Start difference. First operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 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 225 states. [2022-04-28 15:01:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:55,121 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-28 15:01:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-28 15:01:55,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:55,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:55,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:55,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states 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:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2022-04-28 15:01:55,128 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2022-04-28 15:01:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:55,128 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2022-04-28 15:01:55,128 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 15:01:55,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 285 transitions. [2022-04-28 15:01:55,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2022-04-28 15:01:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:55,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:55,426 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 15:01:55,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:01:55,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 1 times [2022-04-28 15:01:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:55,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682018440] [2022-04-28 15:01:55,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 2 times [2022-04-28 15:01:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:55,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595898632] [2022-04-28 15:01:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:55,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {4451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4445#true} is VALID [2022-04-28 15:01:55,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-28 15:01:55,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-28 15:01:55,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {4445#true} call ULTIMATE.init(); {4451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:55,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {4451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4445#true} is VALID [2022-04-28 15:01:55,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-28 15:01:55,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-28 15:01:55,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {4445#true} call #t~ret14 := main(); {4445#true} is VALID [2022-04-28 15:01:55,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {4445#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;havoc ~cond~0; {4445#true} is VALID [2022-04-28 15:01:55,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {4445#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {4445#true} is VALID [2022-04-28 15:01:55,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {4445#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; {4445#true} is VALID [2022-04-28 15:01:55,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {4445#true} assume !(0 != ~p1~0); {4445#true} is VALID [2022-04-28 15:01:55,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {4445#true} assume !(0 != ~p2~0); {4445#true} is VALID [2022-04-28 15:01:55,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#true} assume !(0 != ~p3~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:55,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p3~0; {4446#false} is VALID [2022-04-28 15:01:55,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#false} assume 1 != ~lk3~0; {4446#false} is VALID [2022-04-28 15:01:55,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#false} assume !false; {4446#false} is VALID [2022-04-28 15:01:55,474 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:01:55,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:55,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595898632] [2022-04-28 15:01:55,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595898632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:55,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:55,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:55,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:55,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682018440] [2022-04-28 15:01:55,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682018440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:55,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:55,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040987643] [2022-04-28 15:01:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:55,476 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 15:01:55,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:55,476 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 15:01:55,490 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 15:01:55,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:55,491 INFO L87 Difference]: Start difference. First operand 167 states and 285 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 15:01:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:55,671 INFO L93 Difference]: Finished difference Result 391 states and 675 transitions. [2022-04-28 15:01:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:55,671 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 15:01:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:55,672 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 15:01:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 15:01:55,674 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 15:01:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 15:01:55,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-28 15:01:55,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:55,809 INFO L225 Difference]: With dead ends: 391 [2022-04-28 15:01:55,809 INFO L226 Difference]: Without dead ends: 233 [2022-04-28 15:01:55,810 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:01:55,810 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:55,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-28 15:01:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-04-28 15:01:55,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:55,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states 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:55,832 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states 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:55,832 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states 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:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:55,840 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-28 15:01:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-28 15:01:55,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:55,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:55,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 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 233 states. [2022-04-28 15:01:55,842 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 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 233 states. [2022-04-28 15:01:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:55,849 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-28 15:01:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-28 15:01:55,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:55,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:55,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:55,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states 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:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2022-04-28 15:01:55,859 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2022-04-28 15:01:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:55,859 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2022-04-28 15:01:55,860 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 15:01:55,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 391 transitions. [2022-04-28 15:01:56,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2022-04-28 15:01:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 15:01:56,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:56,239 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 15:01:56,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:01:56,240 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 1 times [2022-04-28 15:01:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538278201] [2022-04-28 15:01:56,241 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 2 times [2022-04-28 15:01:56,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:56,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136491990] [2022-04-28 15:01:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:56,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {6173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-28 15:01:56,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 15:01:56,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-28 15:01:56,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:56,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {6173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-28 15:01:56,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 15:01:56,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-28 15:01:56,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret14 := main(); {6167#true} is VALID [2022-04-28 15:01:56,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#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;havoc ~cond~0; {6167#true} is VALID [2022-04-28 15:01:56,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {6167#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {6167#true} is VALID [2022-04-28 15:01:56,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {6167#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; {6167#true} is VALID [2022-04-28 15:01:56,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {6167#true} assume !(0 != ~p1~0); {6167#true} is VALID [2022-04-28 15:01:56,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {6167#true} assume !(0 != ~p2~0); {6167#true} is VALID [2022-04-28 15:01:56,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {6167#true} assume 0 != ~p3~0;~lk3~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6172#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:56,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6168#false} is VALID [2022-04-28 15:01:56,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {6168#false} assume 0 != ~p4~0; {6168#false} is VALID [2022-04-28 15:01:56,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume 1 != ~lk4~0; {6168#false} is VALID [2022-04-28 15:01:56,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 15:01:56,305 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:01:56,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:56,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136491990] [2022-04-28 15:01:56,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136491990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:56,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:56,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:56,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:56,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538278201] [2022-04-28 15:01:56,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538278201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:56,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:56,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000929747] [2022-04-28 15:01:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:56,307 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 15:01:56,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:56,307 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 15:01:56,322 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 15:01:56,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:56,323 INFO L87 Difference]: Start difference. First operand 231 states and 391 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 15:01:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:56,490 INFO L93 Difference]: Finished difference Result 349 states and 589 transitions. [2022-04-28 15:01:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:56,491 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 15:01:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:56,491 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 15:01:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 15:01:56,493 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 15:01:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 15:01:56,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 15:01:56,614 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 15:01:56,619 INFO L225 Difference]: With dead ends: 349 [2022-04-28 15:01:56,619 INFO L226 Difference]: Without dead ends: 239 [2022-04-28 15:01:56,619 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:01:56,620 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:56,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 97 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-28 15:01:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-28 15:01:56,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:56,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states 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:56,640 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states 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:56,640 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states 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:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:56,646 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-28 15:01:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-28 15:01:56,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:56,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:56,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 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 239 states. [2022-04-28 15:01:56,648 INFO L87 Difference]: Start difference. First operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 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 239 states. [2022-04-28 15:01:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:56,654 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-28 15:01:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-28 15:01:56,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:56,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:56,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:56,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states 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:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2022-04-28 15:01:56,662 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2022-04-28 15:01:56,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:56,662 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2022-04-28 15:01:56,662 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 15:01:56,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 395 transitions. [2022-04-28 15:01:57,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2022-04-28 15:01:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 15:01:57,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:57,068 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 15:01:57,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:01:57,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 1 times [2022-04-28 15:01:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:57,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211115613] [2022-04-28 15:01:57,069 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 2 times [2022-04-28 15:01:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:57,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089526348] [2022-04-28 15:01:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:57,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {7835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7829#true} is VALID [2022-04-28 15:01:57,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-28 15:01:57,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-28 15:01:57,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {7829#true} call ULTIMATE.init(); {7835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:57,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {7835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7829#true} is VALID [2022-04-28 15:01:57,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-28 15:01:57,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-28 15:01:57,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {7829#true} call #t~ret14 := main(); {7829#true} is VALID [2022-04-28 15:01:57,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {7829#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;havoc ~cond~0; {7829#true} is VALID [2022-04-28 15:01:57,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {7829#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {7829#true} is VALID [2022-04-28 15:01:57,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {7829#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; {7829#true} is VALID [2022-04-28 15:01:57,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {7829#true} assume !(0 != ~p1~0); {7829#true} is VALID [2022-04-28 15:01:57,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {7829#true} assume !(0 != ~p2~0); {7829#true} is VALID [2022-04-28 15:01:57,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {7829#true} assume !(0 != ~p3~0); {7829#true} is VALID [2022-04-28 15:01:57,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {7829#true} assume 0 != ~p4~0;~lk4~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:57,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {7834#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7830#false} is VALID [2022-04-28 15:01:57,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {7830#false} assume !false; {7830#false} is VALID [2022-04-28 15:01:57,128 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:01:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:57,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089526348] [2022-04-28 15:01:57,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089526348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:57,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:57,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:57,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:57,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211115613] [2022-04-28 15:01:57,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211115613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:57,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:57,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267032130] [2022-04-28 15:01:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:57,130 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 15:01:57,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:57,130 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 15:01:57,147 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 15:01:57,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:57,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:57,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:57,148 INFO L87 Difference]: Start difference. First operand 237 states and 395 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 15:01:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:57,335 INFO L93 Difference]: Finished difference Result 429 states and 725 transitions. [2022-04-28 15:01:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:57,335 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 15:01:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:57,335 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 15:01:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 15:01:57,337 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 15:01:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 15:01:57,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-28 15:01:57,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:57,425 INFO L225 Difference]: With dead ends: 429 [2022-04-28 15:01:57,426 INFO L226 Difference]: Without dead ends: 427 [2022-04-28 15:01:57,426 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:01:57,427 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:57,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-28 15:01:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-28 15:01:57,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:57,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states 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:57,453 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states 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:57,453 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states 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:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:57,466 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-28 15:01:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-28 15:01:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:57,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:57,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 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 427 states. [2022-04-28 15:01:57,469 INFO L87 Difference]: Start difference. First operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 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 427 states. [2022-04-28 15:01:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:57,482 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-28 15:01:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-28 15:01:57,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:57,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:57,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:57,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states 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:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2022-04-28 15:01:57,504 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2022-04-28 15:01:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:57,504 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2022-04-28 15:01:57,504 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 15:01:57,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 539 transitions. [2022-04-28 15:01:58,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2022-04-28 15:01:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 15:01:58,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:58,014 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 15:01:58,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:01:58,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 1 times [2022-04-28 15:01:58,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:58,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788075857] [2022-04-28 15:01:58,016 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 2 times [2022-04-28 15:01:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987598420] [2022-04-28 15:01:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:58,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {10217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-28 15:01:58,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 15:01:58,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-28 15:01:58,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:58,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {10217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-28 15:01:58,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 15:01:58,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-28 15:01:58,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret14 := main(); {10211#true} is VALID [2022-04-28 15:01:58,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#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;havoc ~cond~0; {10211#true} is VALID [2022-04-28 15:01:58,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {10211#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {10211#true} is VALID [2022-04-28 15:01:58,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {10211#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; {10211#true} is VALID [2022-04-28 15:01:58,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} assume !(0 != ~p1~0); {10211#true} is VALID [2022-04-28 15:01:58,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 != ~p2~0); {10211#true} is VALID [2022-04-28 15:01:58,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume !(0 != ~p3~0); {10211#true} is VALID [2022-04-28 15:01:58,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {10211#true} assume !(0 != ~p4~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p1~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p2~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p3~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:58,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p4~0; {10212#false} is VALID [2022-04-28 15:01:58,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {10212#false} assume 1 != ~lk4~0; {10212#false} is VALID [2022-04-28 15:01:58,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-28 15:01:58,094 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:01:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:58,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987598420] [2022-04-28 15:01:58,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987598420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:58,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:58,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:58,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:58,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788075857] [2022-04-28 15:01:58,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788075857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:58,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:58,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338670917] [2022-04-28 15:01:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:58,095 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 15:01:58,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:58,095 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 15:01:58,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:58,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:58,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:58,114 INFO L87 Difference]: Start difference. First operand 329 states and 539 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 15:01:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:58,353 INFO L93 Difference]: Finished difference Result 765 states and 1261 transitions. [2022-04-28 15:01:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:58,354 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 15:01:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:58,354 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 15:01:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 15:01:58,357 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 15:01:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 15:01:58,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-28 15:01:58,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:58,496 INFO L225 Difference]: With dead ends: 765 [2022-04-28 15:01:58,496 INFO L226 Difference]: Without dead ends: 451 [2022-04-28 15:01:58,497 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:01:58,498 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:58,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 93 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-28 15:01:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-28 15:01:58,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:58,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:58,534 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:58,535 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:58,548 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-28 15:01:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-28 15:01:58,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:58,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:58,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-28 15:01:58,551 INFO L87 Difference]: Start difference. First operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-28 15:01:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:58,565 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-28 15:01:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-28 15:01:58,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:58,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:58,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:58,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2022-04-28 15:01:58,584 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2022-04-28 15:01:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:58,585 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2022-04-28 15:01:58,585 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 15:01:58,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 449 states and 727 transitions. [2022-04-28 15:01:59,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2022-04-28 15:01:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 15:01:59,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:59,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:59,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:01:59,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 1 times [2022-04-28 15:01:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:59,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1651067458] [2022-04-28 15:01:59,260 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 2 times [2022-04-28 15:01:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:59,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607321718] [2022-04-28 15:01:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:59,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {13559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13553#true} is VALID [2022-04-28 15:01:59,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-28 15:01:59,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-28 15:01:59,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {13553#true} call ULTIMATE.init(); {13559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:59,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {13559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13553#true} is VALID [2022-04-28 15:01:59,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-28 15:01:59,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-28 15:01:59,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {13553#true} call #t~ret14 := main(); {13553#true} is VALID [2022-04-28 15:01:59,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {13553#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;havoc ~cond~0; {13553#true} is VALID [2022-04-28 15:01:59,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {13553#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {13553#true} is VALID [2022-04-28 15:01:59,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {13553#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; {13553#true} is VALID [2022-04-28 15:01:59,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {13553#true} assume !(0 != ~p1~0); {13553#true} is VALID [2022-04-28 15:01:59,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {13553#true} assume !(0 != ~p2~0); {13553#true} is VALID [2022-04-28 15:01:59,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {13553#true} assume !(0 != ~p3~0); {13553#true} is VALID [2022-04-28 15:01:59,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {13553#true} assume 0 != ~p4~0;~lk4~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {13558#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:59,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {13554#false} is VALID [2022-04-28 15:01:59,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {13554#false} assume 0 != ~p5~0; {13554#false} is VALID [2022-04-28 15:01:59,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {13554#false} assume 1 != ~lk5~0; {13554#false} is VALID [2022-04-28 15:01:59,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-04-28 15:01:59,322 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:01:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607321718] [2022-04-28 15:01:59,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607321718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:59,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:59,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:59,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1651067458] [2022-04-28 15:01:59,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1651067458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:59,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:59,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257788173] [2022-04-28 15:01:59,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:59,323 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 15:01:59,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:59,324 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 15:01:59,338 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 15:01:59,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:59,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:59,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:59,339 INFO L87 Difference]: Start difference. First operand 449 states and 727 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 15:01:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:59,547 INFO L93 Difference]: Finished difference Result 673 states and 1085 transitions. [2022-04-28 15:01:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:59,548 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 15:01:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:59,548 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 15:01:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 15:01:59,549 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 15:01:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 15:01:59,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-28 15:01:59,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:59,695 INFO L225 Difference]: With dead ends: 673 [2022-04-28 15:01:59,695 INFO L226 Difference]: Without dead ends: 459 [2022-04-28 15:01:59,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 15:01:59,697 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:59,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 94 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-28 15:01:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-28 15:01:59,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:59,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:59,732 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:59,733 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:59,750 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-28 15:01:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-28 15:01:59,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:59,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:59,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-28 15:01:59,752 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-28 15:01:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:59,788 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-28 15:01:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-28 15:01:59,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:59,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:59,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:59,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2022-04-28 15:01:59,810 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2022-04-28 15:01:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:59,810 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2022-04-28 15:01:59,810 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 15:01:59,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 727 transitions. [2022-04-28 15:02:00,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2022-04-28 15:02:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 15:02:00,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:00,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:02:00,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:02:00,514 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:00,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 1 times [2022-04-28 15:02:00,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:00,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957584646] [2022-04-28 15:02:00,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:00,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 2 times [2022-04-28 15:02:00,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:00,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368112616] [2022-04-28 15:02:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:00,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {16749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {16743#true} is VALID [2022-04-28 15:02:00,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-28 15:02:00,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {16743#true} call ULTIMATE.init(); {16749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:00,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {16749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {16743#true} call #t~ret14 := main(); {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {16743#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;havoc ~cond~0; {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {16743#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {16743#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; {16743#true} is VALID [2022-04-28 15:02:00,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {16743#true} assume !(0 != ~p1~0); {16743#true} is VALID [2022-04-28 15:02:00,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {16743#true} assume !(0 != ~p2~0); {16743#true} is VALID [2022-04-28 15:02:00,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {16743#true} assume !(0 != ~p3~0); {16743#true} is VALID [2022-04-28 15:02:00,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {16743#true} assume !(0 != ~p4~0); {16743#true} is VALID [2022-04-28 15:02:00,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {16743#true} assume 0 != ~p5~0;~lk5~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p5~0; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 15:02:00,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {16748#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {16744#false} is VALID [2022-04-28 15:02:00,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {16744#false} assume !false; {16744#false} is VALID [2022-04-28 15:02:00,581 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:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:00,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368112616] [2022-04-28 15:02:00,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368112616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:00,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:00,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:00,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:00,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957584646] [2022-04-28 15:02:00,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957584646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:00,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:00,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740683797] [2022-04-28 15:02:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:00,582 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 15:02:00,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:00,583 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 15:02:00,597 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 15:02:00,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:00,598 INFO L87 Difference]: Start difference. First operand 457 states and 727 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 15:02:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:00,845 INFO L93 Difference]: Finished difference Result 813 states and 1313 transitions. [2022-04-28 15:02:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:00,846 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 15:02:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:00,846 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 15:02:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:02:00,847 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 15:02:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 15:02:00,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 15:02:00,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:00,973 INFO L225 Difference]: With dead ends: 813 [2022-04-28 15:02:00,973 INFO L226 Difference]: Without dead ends: 811 [2022-04-28 15:02:00,974 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:00,975 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:00,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 68 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-04-28 15:02:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2022-04-28 15:02:01,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:01,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states 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:01,026 INFO L74 IsIncluded]: Start isIncluded. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states 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:01,027 INFO L87 Difference]: Start difference. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states 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:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:01,065 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-28 15:02:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-28 15:02:01,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:01,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:01,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 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 811 states. [2022-04-28 15:02:01,070 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 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 811 states. [2022-04-28 15:02:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:01,108 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-28 15:02:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-28 15:02:01,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:01,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:01,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:01,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states 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:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2022-04-28 15:02:01,168 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2022-04-28 15:02:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:01,168 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2022-04-28 15:02:01,168 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 15:02:01,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1007 transitions. [2022-04-28 15:02:02,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1007 edges. 1007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-28 15:02:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 15:02:02,304 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:02,305 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 15:02:02,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:02:02,305 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 1 times [2022-04-28 15:02:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:02,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044619073] [2022-04-28 15:02:02,306 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 2 times [2022-04-28 15:02:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:02,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401876199] [2022-04-28 15:02:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:02,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {21307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21301#true} is VALID [2022-04-28 15:02:02,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-28 15:02:02,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-28 15:02:02,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {21301#true} call ULTIMATE.init(); {21307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:02,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {21307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {21301#true} call #t~ret14 := main(); {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {21301#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;havoc ~cond~0; {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {21301#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {21301#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; {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {21301#true} assume !(0 != ~p1~0); {21301#true} is VALID [2022-04-28 15:02:02,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {21301#true} assume !(0 != ~p2~0); {21301#true} is VALID [2022-04-28 15:02:02,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {21301#true} assume !(0 != ~p3~0); {21301#true} is VALID [2022-04-28 15:02:02,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {21301#true} assume !(0 != ~p4~0); {21301#true} is VALID [2022-04-28 15:02:02,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {21301#true} assume !(0 != ~p5~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p1~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p2~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p3~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p4~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 15:02:02,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p5~0; {21302#false} is VALID [2022-04-28 15:02:02,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {21302#false} assume 1 != ~lk5~0; {21302#false} is VALID [2022-04-28 15:02:02,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {21302#false} assume !false; {21302#false} is VALID [2022-04-28 15:02:02,367 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:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:02,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401876199] [2022-04-28 15:02:02,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401876199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:02,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:02,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:02,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:02,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044619073] [2022-04-28 15:02:02,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044619073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:02,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:02,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526867215] [2022-04-28 15:02:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:02,369 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 15:02:02,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:02,369 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 15:02:02,386 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 15:02:02,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:02,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:02,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:02,387 INFO L87 Difference]: Start difference. First operand 649 states and 1007 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 15:02:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:02,783 INFO L93 Difference]: Finished difference Result 1501 states and 2337 transitions. [2022-04-28 15:02:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:02,783 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 15:02:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:02,783 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 15:02:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-28 15:02:02,785 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 15:02:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-28 15:02:02,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-28 15:02:02,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:02,967 INFO L225 Difference]: With dead ends: 1501 [2022-04-28 15:02:02,967 INFO L226 Difference]: Without dead ends: 875 [2022-04-28 15:02:02,968 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:02,970 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:02,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 95 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-28 15:02:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-28 15:02:03,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:03,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:03,047 INFO L74 IsIncluded]: Start isIncluded. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:03,048 INFO L87 Difference]: Start difference. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:03,092 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-28 15:02:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-28 15:02:03,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:03,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:03,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 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 875 states. [2022-04-28 15:02:03,097 INFO L87 Difference]: Start difference. First operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 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 875 states. [2022-04-28 15:02:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:03,137 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-28 15:02:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-28 15:02:03,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:03,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:03,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:03,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2022-04-28 15:02:03,202 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2022-04-28 15:02:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:03,202 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2022-04-28 15:02:03,202 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 15:02:03,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 873 states and 1335 transitions. [2022-04-28 15:02:04,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1335 edges. 1335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2022-04-28 15:02:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:02:04,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:04,620 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 15:02:04,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:02:04,620 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 1 times [2022-04-28 15:02:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:04,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192479160] [2022-04-28 15:02:04,621 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 2 times [2022-04-28 15:02:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:04,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767507250] [2022-04-28 15:02:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:04,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {27811#true} is VALID [2022-04-28 15:02:04,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-28 15:02:04,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-28 15:02:04,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {27811#true} call ULTIMATE.init(); {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:04,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {27811#true} is VALID [2022-04-28 15:02:04,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-28 15:02:04,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-28 15:02:04,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {27811#true} call #t~ret14 := main(); {27811#true} is VALID [2022-04-28 15:02:04,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {27811#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;havoc ~cond~0; {27811#true} is VALID [2022-04-28 15:02:04,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {27811#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {27811#true} is VALID [2022-04-28 15:02:04,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {27811#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; {27811#true} is VALID [2022-04-28 15:02:04,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {27811#true} assume !(0 != ~p1~0); {27811#true} is VALID [2022-04-28 15:02:04,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {27811#true} assume !(0 != ~p2~0); {27811#true} is VALID [2022-04-28 15:02:04,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {27811#true} assume !(0 != ~p3~0); {27811#true} is VALID [2022-04-28 15:02:04,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {27811#true} assume !(0 != ~p4~0); {27811#true} is VALID [2022-04-28 15:02:04,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {27811#true} assume 0 != ~p5~0;~lk5~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:02:04,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {27812#false} is VALID [2022-04-28 15:02:04,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {27812#false} assume 0 != ~p6~0; {27812#false} is VALID [2022-04-28 15:02:04,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {27812#false} assume 1 != ~lk6~0; {27812#false} is VALID [2022-04-28 15:02:04,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {27812#false} assume !false; {27812#false} is VALID [2022-04-28 15:02:04,668 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:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:04,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767507250] [2022-04-28 15:02:04,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767507250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:04,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:04,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:04,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:04,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192479160] [2022-04-28 15:02:04,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192479160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:04,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:04,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91696342] [2022-04-28 15:02:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:04,669 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 15:02:04,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:04,670 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 15:02:04,686 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 15:02:04,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:04,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:04,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:04,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:04,687 INFO L87 Difference]: Start difference. First operand 873 states and 1335 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 15:02:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:05,020 INFO L93 Difference]: Finished difference Result 1309 states and 1993 transitions. [2022-04-28 15:02:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:05,020 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 15:02:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:05,020 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 15:02:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-28 15:02:05,022 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 15:02:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-28 15:02:05,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2022-04-28 15:02:05,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:05,201 INFO L225 Difference]: With dead ends: 1309 [2022-04-28 15:02:05,201 INFO L226 Difference]: Without dead ends: 891 [2022-04-28 15:02:05,202 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,203 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:05,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 91 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-04-28 15:02:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2022-04-28 15:02:05,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:05,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:05,298 INFO L74 IsIncluded]: Start isIncluded. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:05,299 INFO L87 Difference]: Start difference. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:05,340 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-28 15:02:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-28 15:02:05,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:05,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:05,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 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 891 states. [2022-04-28 15:02:05,345 INFO L87 Difference]: Start difference. First operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 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 891 states. [2022-04-28 15:02:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:05,385 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-28 15:02:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-28 15:02:05,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:05,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:05,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:05,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states 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:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2022-04-28 15:02:05,450 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2022-04-28 15:02:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:05,450 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2022-04-28 15:02:05,451 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 15:02:05,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 889 states and 1335 transitions. [2022-04-28 15:02:06,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1335 edges. 1335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2022-04-28 15:02:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:02:06,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:06,780 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 15:02:06,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:02:06,780 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 1 times [2022-04-28 15:02:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:06,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946862595] [2022-04-28 15:02:06,783 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 2 times [2022-04-28 15:02:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:06,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825417897] [2022-04-28 15:02:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:06,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {34007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {34001#true} is VALID [2022-04-28 15:02:06,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 15:02:06,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-28 15:02:06,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {34001#true} call ULTIMATE.init(); {34007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:06,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {34007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {34001#true} is VALID [2022-04-28 15:02:06,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {34001#true} call #t~ret14 := main(); {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {34001#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;havoc ~cond~0; {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {34001#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {34001#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; {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {34001#true} assume !(0 != ~p1~0); {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {34001#true} assume !(0 != ~p2~0); {34001#true} is VALID [2022-04-28 15:02:06,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {34001#true} assume !(0 != ~p3~0); {34001#true} is VALID [2022-04-28 15:02:06,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {34001#true} assume !(0 != ~p4~0); {34001#true} is VALID [2022-04-28 15:02:06,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {34001#true} assume !(0 != ~p5~0); {34001#true} is VALID [2022-04-28 15:02:06,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {34001#true} assume 0 != ~p6~0;~lk6~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p6~0; {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 15:02:06,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {34006#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {34002#false} is VALID [2022-04-28 15:02:06,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-28 15:02:06,825 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:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:06,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825417897] [2022-04-28 15:02:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825417897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:06,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:06,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:06,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:06,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946862595] [2022-04-28 15:02:06,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946862595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:06,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:06,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:06,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85063080] [2022-04-28 15:02:06,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:06,827 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 15:02:06,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:06,827 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 15:02:06,842 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 15:02:06,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:06,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:06,843 INFO L87 Difference]: Start difference. First operand 889 states and 1335 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 15:02:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:07,194 INFO L93 Difference]: Finished difference Result 1549 states and 2361 transitions. [2022-04-28 15:02:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:07,194 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 15:02:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:07,195 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 15:02:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 15:02:07,196 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 15:02:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 15:02:07,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 15:02:07,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:07,376 INFO L225 Difference]: With dead ends: 1549 [2022-04-28 15:02:07,376 INFO L226 Difference]: Without dead ends: 1547 [2022-04-28 15:02:07,377 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:07,377 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:07,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-28 15:02:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2022-04-28 15:02:07,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:07,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,505 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,507 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:07,605 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-28 15:02:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-28 15:02:07,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:07,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:07,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-28 15:02:07,612 INFO L87 Difference]: Start difference. First operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-28 15:02:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:07,726 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-28 15:02:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-28 15:02:07,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:07,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:07,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:07,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2022-04-28 15:02:07,849 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2022-04-28 15:02:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:07,849 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2022-04-28 15:02:07,849 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 15:02:07,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1289 states and 1879 transitions. [2022-04-28 15:02:09,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1879 edges. 1879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2022-04-28 15:02:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:02:09,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:09,750 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 15:02:09,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:02:09,751 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 1 times [2022-04-28 15:02:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:09,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717770078] [2022-04-28 15:02:09,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 2 times [2022-04-28 15:02:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:09,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145681981] [2022-04-28 15:02:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:09,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:09,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {42789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42783#true} is VALID [2022-04-28 15:02:09,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-28 15:02:09,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-28 15:02:09,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {42783#true} call ULTIMATE.init(); {42789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:09,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {42789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42783#true} is VALID [2022-04-28 15:02:09,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-28 15:02:09,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-28 15:02:09,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {42783#true} call #t~ret14 := main(); {42783#true} is VALID [2022-04-28 15:02:09,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {42783#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;havoc ~cond~0; {42783#true} is VALID [2022-04-28 15:02:09,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {42783#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {42783#true} is VALID [2022-04-28 15:02:09,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {42783#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; {42783#true} is VALID [2022-04-28 15:02:09,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {42783#true} assume !(0 != ~p1~0); {42783#true} is VALID [2022-04-28 15:02:09,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {42783#true} assume !(0 != ~p2~0); {42783#true} is VALID [2022-04-28 15:02:09,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {42783#true} assume !(0 != ~p3~0); {42783#true} is VALID [2022-04-28 15:02:09,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {42783#true} assume !(0 != ~p4~0); {42783#true} is VALID [2022-04-28 15:02:09,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {42783#true} assume !(0 != ~p5~0); {42783#true} is VALID [2022-04-28 15:02:09,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {42783#true} assume !(0 != ~p6~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p1~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p2~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p3~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p4~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p5~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 15:02:09,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p6~0; {42784#false} is VALID [2022-04-28 15:02:09,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {42784#false} assume 1 != ~lk6~0; {42784#false} is VALID [2022-04-28 15:02:09,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {42784#false} assume !false; {42784#false} is VALID [2022-04-28 15:02:09,825 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:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145681981] [2022-04-28 15:02:09,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145681981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:09,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:09,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:09,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717770078] [2022-04-28 15:02:09,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717770078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:09,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:09,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159875615] [2022-04-28 15:02:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:09,826 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 15:02:09,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:09,827 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 15:02:09,842 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 15:02:09,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:09,843 INFO L87 Difference]: Start difference. First operand 1289 states and 1879 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 15:02:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:10,513 INFO L93 Difference]: Finished difference Result 2957 states and 4313 transitions. [2022-04-28 15:02:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:10,513 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 15:02:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:10,514 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 15:02:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 15:02:10,517 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 15:02:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 15:02:10,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 15:02:10,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:10,783 INFO L225 Difference]: With dead ends: 2957 [2022-04-28 15:02:10,783 INFO L226 Difference]: Without dead ends: 1707 [2022-04-28 15:02:10,785 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:10,786 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:10,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 97 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-04-28 15:02:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2022-04-28 15:02:10,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:10,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:10,950 INFO L74 IsIncluded]: Start isIncluded. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:10,953 INFO L87 Difference]: Start difference. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:11,088 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-28 15:02:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-28 15:02:11,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:11,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:11,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1707 states. [2022-04-28 15:02:11,096 INFO L87 Difference]: Start difference. First operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1707 states. [2022-04-28 15:02:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:11,232 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-28 15:02:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-28 15:02:11,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:11,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:11,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:11,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2022-04-28 15:02:11,441 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2022-04-28 15:02:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:11,441 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2022-04-28 15:02:11,441 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 15:02:11,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1705 states and 2439 transitions. [2022-04-28 15:02:14,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2439 edges. 2439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2022-04-28 15:02:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:02:14,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:14,040 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 15:02:14,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:02:14,040 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:14,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 1 times [2022-04-28 15:02:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:14,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221440114] [2022-04-28 15:02:14,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 2 times [2022-04-28 15:02:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:14,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260036639] [2022-04-28 15:02:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:14,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:14,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {55539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {55533#true} is VALID [2022-04-28 15:02:14,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-28 15:02:14,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-28 15:02:14,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {55533#true} call ULTIMATE.init(); {55539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:14,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {55539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {55533#true} is VALID [2022-04-28 15:02:14,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-28 15:02:14,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-28 15:02:14,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {55533#true} call #t~ret14 := main(); {55533#true} is VALID [2022-04-28 15:02:14,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {55533#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;havoc ~cond~0; {55533#true} is VALID [2022-04-28 15:02:14,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {55533#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {55533#true} is VALID [2022-04-28 15:02:14,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {55533#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; {55533#true} is VALID [2022-04-28 15:02:14,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {55533#true} assume !(0 != ~p1~0); {55533#true} is VALID [2022-04-28 15:02:14,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {55533#true} assume !(0 != ~p2~0); {55533#true} is VALID [2022-04-28 15:02:14,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {55533#true} assume !(0 != ~p3~0); {55533#true} is VALID [2022-04-28 15:02:14,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {55533#true} assume !(0 != ~p4~0); {55533#true} is VALID [2022-04-28 15:02:14,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {55533#true} assume !(0 != ~p5~0); {55533#true} is VALID [2022-04-28 15:02:14,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {55533#true} assume 0 != ~p6~0;~lk6~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {55538#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {55538#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {55538#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:02:14,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {55534#false} is VALID [2022-04-28 15:02:14,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {55534#false} assume 0 != ~p7~0; {55534#false} is VALID [2022-04-28 15:02:14,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {55534#false} assume 1 != ~lk7~0; {55534#false} is VALID [2022-04-28 15:02:14,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {55534#false} assume !false; {55534#false} is VALID [2022-04-28 15:02:14,080 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:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:14,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260036639] [2022-04-28 15:02:14,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260036639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:14,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:14,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:14,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:14,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221440114] [2022-04-28 15:02:14,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221440114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:14,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:14,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:14,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584711299] [2022-04-28 15:02:14,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:14,082 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 15:02:14,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:14,082 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 15:02:14,098 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 15:02:14,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:14,098 INFO L87 Difference]: Start difference. First operand 1705 states and 2439 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 15:02:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:14,646 INFO L93 Difference]: Finished difference Result 2557 states and 3641 transitions. [2022-04-28 15:02:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:14,646 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 15:02:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:14,647 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 15:02:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 15:02:14,648 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 15:02:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 15:02:14,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-28 15:02:14,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:14,867 INFO L225 Difference]: With dead ends: 2557 [2022-04-28 15:02:14,868 INFO L226 Difference]: Without dead ends: 1739 [2022-04-28 15:02:14,869 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:14,870 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:14,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-28 15:02:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-28 15:02:15,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:15,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:15,034 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:15,036 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:15,181 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-28 15:02:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-28 15:02:15,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:15,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:15,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1739 states. [2022-04-28 15:02:15,189 INFO L87 Difference]: Start difference. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1739 states. [2022-04-28 15:02:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:15,332 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-28 15:02:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-28 15:02:15,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:15,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:15,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:15,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states 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:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-28 15:02:15,580 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-28 15:02:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:15,580 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-28 15:02:15,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 15:02:15,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1737 states and 2439 transitions. [2022-04-28 15:02:18,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2439 edges. 2439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-28 15:02:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:02:18,085 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:18,085 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 15:02:18,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:02:18,086 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 1 times [2022-04-28 15:02:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305071996] [2022-04-28 15:02:18,086 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 2 times [2022-04-28 15:02:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:18,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777045127] [2022-04-28 15:02:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:18,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {67617#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {67611#true} is VALID [2022-04-28 15:02:18,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-28 15:02:18,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-28 15:02:18,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {67611#true} call ULTIMATE.init(); {67617#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:18,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {67617#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {67611#true} is VALID [2022-04-28 15:02:18,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-28 15:02:18,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-28 15:02:18,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {67611#true} call #t~ret14 := main(); {67611#true} is VALID [2022-04-28 15:02:18,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {67611#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;havoc ~cond~0; {67611#true} is VALID [2022-04-28 15:02:18,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {67611#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {67611#true} is VALID [2022-04-28 15:02:18,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {67611#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; {67611#true} is VALID [2022-04-28 15:02:18,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {67611#true} assume !(0 != ~p1~0); {67611#true} is VALID [2022-04-28 15:02:18,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {67611#true} assume !(0 != ~p2~0); {67611#true} is VALID [2022-04-28 15:02:18,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {67611#true} assume !(0 != ~p3~0); {67611#true} is VALID [2022-04-28 15:02:18,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {67611#true} assume !(0 != ~p4~0); {67611#true} is VALID [2022-04-28 15:02:18,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {67611#true} assume !(0 != ~p5~0); {67611#true} is VALID [2022-04-28 15:02:18,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {67611#true} assume !(0 != ~p6~0); {67611#true} is VALID [2022-04-28 15:02:18,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {67611#true} assume 0 != ~p7~0;~lk7~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p7~0; {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 15:02:18,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {67616#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {67612#false} is VALID [2022-04-28 15:02:18,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {67612#false} assume !false; {67612#false} is VALID [2022-04-28 15:02:18,148 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:18,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:18,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777045127] [2022-04-28 15:02:18,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777045127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:18,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:18,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:18,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:18,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305071996] [2022-04-28 15:02:18,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305071996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:18,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:18,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402199922] [2022-04-28 15:02:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:18,150 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 15:02:18,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:18,150 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 15:02:18,166 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 15:02:18,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:18,167 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 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 15:02:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:18,840 INFO L93 Difference]: Finished difference Result 2957 states and 4201 transitions. [2022-04-28 15:02:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:18,840 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 15:02:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:18,840 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 15:02:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 15:02:18,841 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 15:02:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 15:02:18,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-28 15:02:18,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:19,274 INFO L225 Difference]: With dead ends: 2957 [2022-04-28 15:02:19,275 INFO L226 Difference]: Without dead ends: 2955 [2022-04-28 15:02:19,275 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:19,276 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:19,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-28 15:02:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-28 15:02:19,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:19,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states 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:19,506 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states 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:19,508 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states 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:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:19,742 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-28 15:02:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-28 15:02:19,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:19,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:19,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 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 2955 states. [2022-04-28 15:02:19,750 INFO L87 Difference]: Start difference. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 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 2955 states. [2022-04-28 15:02:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:19,998 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-28 15:02:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-28 15:02:20,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:20,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:20,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:20,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states 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:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-28 15:02:20,317 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-28 15:02:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:20,317 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-28 15:02:20,317 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 15:02:20,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2569 states and 3495 transitions. [2022-04-28 15:02:23,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3495 edges. 3495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-28 15:02:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:02:23,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:23,826 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 15:02:23,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:02:23,827 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 1 times [2022-04-28 15:02:23,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:23,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423930717] [2022-04-28 15:02:23,828 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 2 times [2022-04-28 15:02:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:23,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168236572] [2022-04-28 15:02:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:23,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:23,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {84591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {84585#true} is VALID [2022-04-28 15:02:23,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-28 15:02:23,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-28 15:02:23,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {84585#true} call ULTIMATE.init(); {84591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:23,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {84591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {84585#true} is VALID [2022-04-28 15:02:23,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-28 15:02:23,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-28 15:02:23,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {84585#true} call #t~ret14 := main(); {84585#true} is VALID [2022-04-28 15:02:23,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {84585#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;havoc ~cond~0; {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {84585#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {84585#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; {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {84585#true} assume !(0 != ~p1~0); {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {84585#true} assume !(0 != ~p2~0); {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {84585#true} assume !(0 != ~p3~0); {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {84585#true} assume !(0 != ~p4~0); {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {84585#true} assume !(0 != ~p5~0); {84585#true} is VALID [2022-04-28 15:02:23,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {84585#true} assume !(0 != ~p6~0); {84585#true} is VALID [2022-04-28 15:02:23,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {84585#true} assume !(0 != ~p7~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p1~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p2~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p3~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p4~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p5~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p6~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 15:02:23,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p7~0; {84586#false} is VALID [2022-04-28 15:02:23,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {84586#false} assume 1 != ~lk7~0; {84586#false} is VALID [2022-04-28 15:02:23,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {84586#false} assume !false; {84586#false} is VALID [2022-04-28 15:02:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:02:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:23,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168236572] [2022-04-28 15:02:23,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168236572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:23,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:23,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:23,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:23,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423930717] [2022-04-28 15:02:23,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423930717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:23,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:23,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902682306] [2022-04-28 15:02:23,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:23,877 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 15:02:23,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:23,877 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 15:02:23,892 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 15:02:23,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:23,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:23,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:23,893 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 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 15:02:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:25,890 INFO L93 Difference]: Finished difference Result 5837 states and 7913 transitions. [2022-04-28 15:02:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:25,890 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 15:02:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:25,890 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 15:02:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 15:02:25,891 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 15:02:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 15:02:25,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-28 15:02:25,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:26,510 INFO L225 Difference]: With dead ends: 5837 [2022-04-28 15:02:26,510 INFO L226 Difference]: Without dead ends: 3339 [2022-04-28 15:02:26,514 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:26,515 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:26,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-28 15:02:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-28 15:02:26,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:26,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:26,834 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:26,837 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:27,206 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-28 15:02:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-28 15:02:27,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:27,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:27,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3339 states. [2022-04-28 15:02:27,219 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3339 states. [2022-04-28 15:02:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:27,584 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-28 15:02:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-28 15:02:27,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:27,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:27,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:27,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-28 15:02:28,171 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-28 15:02:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:28,171 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-28 15:02:28,171 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 15:02:28,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 4423 transitions. [2022-04-28 15:02:32,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4423 edges. 4423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-28 15:02:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 15:02:32,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:32,554 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 15:02:32,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:02:32,554 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 1 times [2022-04-28 15:02:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:32,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139220782] [2022-04-28 15:02:32,554 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 2 times [2022-04-28 15:02:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:32,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255666718] [2022-04-28 15:02:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:32,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {109629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {109623#true} is VALID [2022-04-28 15:02:32,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-28 15:02:32,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-28 15:02:32,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {109623#true} call ULTIMATE.init(); {109629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:32,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {109629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {109623#true} is VALID [2022-04-28 15:02:32,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-28 15:02:32,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {109623#true} call #t~ret14 := main(); {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {109623#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;havoc ~cond~0; {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {109623#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {109623#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; {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {109623#true} assume !(0 != ~p1~0); {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {109623#true} assume !(0 != ~p2~0); {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {109623#true} assume !(0 != ~p3~0); {109623#true} is VALID [2022-04-28 15:02:32,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {109623#true} assume !(0 != ~p4~0); {109623#true} is VALID [2022-04-28 15:02:32,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {109623#true} assume !(0 != ~p5~0); {109623#true} is VALID [2022-04-28 15:02:32,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {109623#true} assume !(0 != ~p6~0); {109623#true} is VALID [2022-04-28 15:02:32,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {109623#true} assume 0 != ~p7~0;~lk7~0 := 1; {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {109628#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {109628#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:32,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {109624#false} is VALID [2022-04-28 15:02:32,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {109624#false} assume 0 != ~p8~0; {109624#false} is VALID [2022-04-28 15:02:32,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {109624#false} assume 1 != ~lk8~0; {109624#false} is VALID [2022-04-28 15:02:32,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {109624#false} assume !false; {109624#false} is VALID [2022-04-28 15:02:32,605 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:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:32,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255666718] [2022-04-28 15:02:32,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255666718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:32,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:32,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:32,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:32,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1139220782] [2022-04-28 15:02:32,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1139220782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:32,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:32,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112803388] [2022-04-28 15:02:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:32,606 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 15:02:32,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:32,607 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 15:02:32,623 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 15:02:32,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:32,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:32,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:32,624 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 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 15:02:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:34,072 INFO L93 Difference]: Finished difference Result 5005 states and 6601 transitions. [2022-04-28 15:02:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:34,072 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 15:02:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:34,072 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 15:02:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 15:02:34,073 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 15:02:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 15:02:34,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 15:02:34,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:34,675 INFO L225 Difference]: With dead ends: 5005 [2022-04-28 15:02:34,675 INFO L226 Difference]: Without dead ends: 3403 [2022-04-28 15:02:34,677 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:34,678 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:34,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 85 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-28 15:02:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-28 15:02:34,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:34,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:34,981 INFO L74 IsIncluded]: Start isIncluded. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:34,982 INFO L87 Difference]: Start difference. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:35,326 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-28 15:02:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-28 15:02:35,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:35,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:35,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3403 states. [2022-04-28 15:02:35,334 INFO L87 Difference]: Start difference. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3403 states. [2022-04-28 15:02:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:35,721 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-28 15:02:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-28 15:02:35,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:35,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:35,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:35,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states 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:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-28 15:02:36,363 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-28 15:02:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:36,363 INFO L495 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-28 15:02:36,363 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 15:02:36,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3401 states and 4423 transitions. [2022-04-28 15:02:40,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4423 edges. 4423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-28 15:02:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 15:02:40,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:40,857 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 15:02:40,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:02:40,857 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 1 times [2022-04-28 15:02:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:40,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816157] [2022-04-28 15:02:40,858 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 2 times [2022-04-28 15:02:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:40,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206724634] [2022-04-28 15:02:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:40,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {133259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {133253#true} is VALID [2022-04-28 15:02:40,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-28 15:02:40,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-28 15:02:40,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {133253#true} call ULTIMATE.init(); {133259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:40,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {133259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {133253#true} is VALID [2022-04-28 15:02:40,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-28 15:02:40,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-28 15:02:40,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {133253#true} call #t~ret14 := main(); {133253#true} is VALID [2022-04-28 15:02:40,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {133253#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;havoc ~cond~0; {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {133253#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {133253#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; {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {133253#true} assume !(0 != ~p1~0); {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {133253#true} assume !(0 != ~p2~0); {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {133253#true} assume !(0 != ~p3~0); {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {133253#true} assume !(0 != ~p4~0); {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {133253#true} assume !(0 != ~p5~0); {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {133253#true} assume !(0 != ~p6~0); {133253#true} is VALID [2022-04-28 15:02:40,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {133253#true} assume !(0 != ~p7~0); {133253#true} is VALID [2022-04-28 15:02:40,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {133253#true} assume 0 != ~p8~0;~lk8~0 := 1; {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {133258#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {133258#(= main_~lk8~0 1)} assume 0 != ~p8~0; {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:40,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {133258#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {133254#false} is VALID [2022-04-28 15:02:40,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {133254#false} assume !false; {133254#false} is VALID [2022-04-28 15:02:40,902 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:40,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:40,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206724634] [2022-04-28 15:02:40,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206724634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:40,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:40,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:40,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:40,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816157] [2022-04-28 15:02:40,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:40,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:40,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995737188] [2022-04-28 15:02:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:40,904 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 15:02:40,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:40,904 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 15:02:40,921 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 15:02:40,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:40,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:40,922 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 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 15:02:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:42,849 INFO L93 Difference]: Finished difference Result 5645 states and 7369 transitions. [2022-04-28 15:02:42,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:42,849 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 15:02:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:02:42,850 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 15:02:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:02:42,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 15:02:42,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:44,170 INFO L225 Difference]: With dead ends: 5645 [2022-04-28 15:02:44,170 INFO L226 Difference]: Without dead ends: 5643 [2022-04-28 15:02:44,171 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:44,171 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:44,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-28 15:02:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-28 15:02:44,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:44,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states 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:44,592 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states 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:44,595 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states 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:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:45,496 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-28 15:02:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-28 15:02:45,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:45,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:45,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 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 5643 states. [2022-04-28 15:02:45,509 INFO L87 Difference]: Start difference. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 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 5643 states. [2022-04-28 15:02:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:46,423 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-28 15:02:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-28 15:02:46,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:46,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:46,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:46,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states 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:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-28 15:02:47,658 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-28 15:02:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:47,658 INFO L495 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-28 15:02:47,658 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 15:02:47,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5129 states and 6471 transitions. [2022-04-28 15:02:54,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6471 edges. 6471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-28 15:02:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 15:02:54,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:54,430 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 15:02:54,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:02:54,430 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 1 times [2022-04-28 15:02:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:54,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106366399] [2022-04-28 15:02:54,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 2 times [2022-04-28 15:02:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:54,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473856433] [2022-04-28 15:02:54,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:54,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {166105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {166099#true} is VALID [2022-04-28 15:02:54,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-28 15:02:54,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {166099#true} call ULTIMATE.init(); {166105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:54,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {166105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {166099#true} call #t~ret14 := main(); {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {166099#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;havoc ~cond~0; {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {166099#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {166099#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; {166099#true} is VALID [2022-04-28 15:02:54,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {166099#true} assume !(0 != ~p1~0); {166099#true} is VALID [2022-04-28 15:02:54,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {166099#true} assume !(0 != ~p2~0); {166099#true} is VALID [2022-04-28 15:02:54,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {166099#true} assume !(0 != ~p3~0); {166099#true} is VALID [2022-04-28 15:02:54,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {166099#true} assume !(0 != ~p4~0); {166099#true} is VALID [2022-04-28 15:02:54,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {166099#true} assume !(0 != ~p5~0); {166099#true} is VALID [2022-04-28 15:02:54,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {166099#true} assume !(0 != ~p6~0); {166099#true} is VALID [2022-04-28 15:02:54,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {166099#true} assume !(0 != ~p7~0); {166099#true} is VALID [2022-04-28 15:02:54,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {166099#true} assume !(0 != ~p8~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {166104#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p1~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p2~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p3~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p4~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p5~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p6~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p7~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:54,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {166104#(= main_~p8~0 0)} assume 0 != ~p8~0; {166100#false} is VALID [2022-04-28 15:02:54,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {166100#false} assume 1 != ~lk8~0; {166100#false} is VALID [2022-04-28 15:02:54,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {166100#false} assume !false; {166100#false} is VALID [2022-04-28 15:02:54,477 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:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:54,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473856433] [2022-04-28 15:02:54,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473856433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:54,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:54,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:54,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:54,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106366399] [2022-04-28 15:02:54,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106366399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:54,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:54,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760405586] [2022-04-28 15:02:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:54,478 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 15:02:54,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:54,479 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 15:02:54,494 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 15:02:54,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:54,495 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 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 15:03:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:01,081 INFO L93 Difference]: Finished difference Result 11533 states and 14409 transitions. [2022-04-28 15:03:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:03:01,081 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 15:03:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:03:01,081 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 15:03:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 15:03:01,083 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 15:03:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 15:03:01,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-28 15:03:01,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:03,080 INFO L225 Difference]: With dead ends: 11533 [2022-04-28 15:03:03,080 INFO L226 Difference]: Without dead ends: 6539 [2022-04-28 15:03:03,086 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:03,086 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:03:03,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:03:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-28 15:03:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-28 15:03:03,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:03:03,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:03,636 INFO L74 IsIncluded]: Start isIncluded. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:03,643 INFO L87 Difference]: Start difference. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:04,935 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-28 15:03:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-28 15:03:04,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:04,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:04,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6539 states. [2022-04-28 15:03:04,956 INFO L87 Difference]: Start difference. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6539 states. [2022-04-28 15:03:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:06,315 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-28 15:03:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-28 15:03:06,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:06,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:06,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:03:06,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:03:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-28 15:03:08,524 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-28 15:03:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:03:08,524 INFO L495 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-28 15:03:08,524 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 15:03:08,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6537 states and 7943 transitions. [2022-04-28 15:03:16,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7943 edges. 7943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-28 15:03:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 15:03:16,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:03:16,819 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 15:03:16,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:03:16,819 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:03:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:03:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 1 times [2022-04-28 15:03:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:16,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2055830017] [2022-04-28 15:03:16,819 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:03:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 2 times [2022-04-28 15:03:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:03:16,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998822744] [2022-04-28 15:03:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:03:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:03:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:03:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:16,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {215335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {215329#true} is VALID [2022-04-28 15:03:16,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-28 15:03:16,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-28 15:03:16,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {215329#true} call ULTIMATE.init(); {215335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:03:16,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {215335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {215329#true} call #t~ret14 := main(); {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {215329#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;havoc ~cond~0; {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {215329#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {215329#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; {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {215329#true} assume !(0 != ~p1~0); {215329#true} is VALID [2022-04-28 15:03:16,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {215329#true} assume !(0 != ~p2~0); {215329#true} is VALID [2022-04-28 15:03:16,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {215329#true} assume !(0 != ~p3~0); {215329#true} is VALID [2022-04-28 15:03:16,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {215329#true} assume !(0 != ~p4~0); {215329#true} is VALID [2022-04-28 15:03:16,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {215329#true} assume !(0 != ~p5~0); {215329#true} is VALID [2022-04-28 15:03:16,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {215329#true} assume !(0 != ~p6~0); {215329#true} is VALID [2022-04-28 15:03:16,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {215329#true} assume !(0 != ~p7~0); {215329#true} is VALID [2022-04-28 15:03:16,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {215329#true} assume 0 != ~p8~0;~lk8~0 := 1; {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {215334#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:16,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {215330#false} is VALID [2022-04-28 15:03:16,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {215330#false} assume 0 != ~p9~0; {215330#false} is VALID [2022-04-28 15:03:16,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {215330#false} assume 1 != ~lk9~0; {215330#false} is VALID [2022-04-28 15:03:16,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {215330#false} assume !false; {215330#false} is VALID [2022-04-28 15:03:16,858 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:03:16,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:03:16,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998822744] [2022-04-28 15:03:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998822744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:16,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:16,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:03:16,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2055830017] [2022-04-28 15:03:16,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2055830017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:16,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:16,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954038650] [2022-04-28 15:03:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:03:16,859 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 15:03:16,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:03:16,860 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 15:03:16,879 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 15:03:16,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:03:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:03:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:03:16,880 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 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 15:03:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:21,819 INFO L93 Difference]: Finished difference Result 9805 states and 11849 transitions. [2022-04-28 15:03:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:03:21,819 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 15:03:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:03:21,819 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 15:03:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 15:03:21,820 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 15:03:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 15:03:21,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 15:03:21,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:23,901 INFO L225 Difference]: With dead ends: 9805 [2022-04-28 15:03:23,902 INFO L226 Difference]: Without dead ends: 6667 [2022-04-28 15:03:23,905 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:23,906 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:03:23,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:03:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-28 15:03:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-28 15:03:24,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:03:24,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:24,404 INFO L74 IsIncluded]: Start isIncluded. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:24,410 INFO L87 Difference]: Start difference. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:25,769 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-28 15:03:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-28 15:03:25,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:25,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:25,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6667 states. [2022-04-28 15:03:25,787 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6667 states. [2022-04-28 15:03:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:27,085 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-28 15:03:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-28 15:03:27,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:27,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:27,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:03:27,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:03:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states 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:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-28 15:03:29,369 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-28 15:03:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:03:29,369 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-28 15:03:29,369 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 15:03:29,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 7943 transitions. [2022-04-28 15:03:37,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7943 edges. 7943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-28 15:03:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 15:03:37,721 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:03:37,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:03:37,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:03:37,721 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:03:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:03:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 1 times [2022-04-28 15:03:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [686811764] [2022-04-28 15:03:37,722 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:03:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 2 times [2022-04-28 15:03:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:03:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388696221] [2022-04-28 15:03:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:03:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:03:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:03:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:37,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {261621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {261615#true} is VALID [2022-04-28 15:03:37,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-28 15:03:37,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-28 15:03:37,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {261615#true} call ULTIMATE.init(); {261621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:03:37,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {261621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {261615#true} is VALID [2022-04-28 15:03:37,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-28 15:03:37,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-28 15:03:37,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {261615#true} call #t~ret14 := main(); {261615#true} is VALID [2022-04-28 15:03:37,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {261615#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;havoc ~cond~0; {261615#true} is VALID [2022-04-28 15:03:37,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {261615#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {261615#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; {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {261615#true} assume !(0 != ~p1~0); {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {261615#true} assume !(0 != ~p2~0); {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {261615#true} assume !(0 != ~p3~0); {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {261615#true} assume !(0 != ~p4~0); {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {261615#true} assume !(0 != ~p5~0); {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {261615#true} assume !(0 != ~p6~0); {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {261615#true} assume !(0 != ~p7~0); {261615#true} is VALID [2022-04-28 15:03:37,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {261615#true} assume !(0 != ~p8~0); {261615#true} is VALID [2022-04-28 15:03:37,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {261615#true} assume 0 != ~p9~0;~lk9~0 := 1; {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {261620#(= main_~lk9~0 1)} assume 0 != ~p9~0; {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:37,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {261620#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {261616#false} is VALID [2022-04-28 15:03:37,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {261616#false} assume !false; {261616#false} is VALID [2022-04-28 15:03:37,773 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:03:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:03:37,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388696221] [2022-04-28 15:03:37,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388696221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:37,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:37,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:37,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:03:37,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [686811764] [2022-04-28 15:03:37,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [686811764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:37,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:37,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925754272] [2022-04-28 15:03:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:03:37,775 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 15:03:37,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:03:37,775 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 15:03:37,794 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 15:03:37,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:03:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:03:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:03:37,795 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 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 15:03:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:44,014 INFO L93 Difference]: Finished difference Result 10763 states and 12680 transitions. [2022-04-28 15:03:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:03:44,014 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 15:03:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:03:44,015 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 15:03:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-28 15:03:44,015 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 15:03:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-28 15:03:44,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-28 15:03:44,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:48,858 INFO L225 Difference]: With dead ends: 10763 [2022-04-28 15:03:48,858 INFO L226 Difference]: Without dead ends: 10761 [2022-04-28 15:03:48,860 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:48,860 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:03:48,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:03:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-28 15:03:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-28 15:03:49,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:03:49,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states 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:49,719 INFO L74 IsIncluded]: Start isIncluded. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states 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:49,729 INFO L87 Difference]: Start difference. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states 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:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:52,850 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-28 15:03:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-28 15:03:52,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:52,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:52,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 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 10761 states. [2022-04-28 15:03:52,884 INFO L87 Difference]: Start difference. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 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 10761 states. [2022-04-28 15:03:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:56,021 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-28 15:03:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-28 15:03:56,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:56,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:56,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:03:56,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:03:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states 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:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-28 15:04:00,964 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-28 15:04:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:04:00,964 INFO L495 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-28 15:04:00,964 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 15:04:00,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10249 states and 11911 transitions. [2022-04-28 15:04:13,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11911 edges. 11911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-28 15:04:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 15:04:13,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:04:13,944 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 15:04:13,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:04:13,945 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:04:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:04:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 1 times [2022-04-28 15:04:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938015028] [2022-04-28 15:04:13,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:04:13,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 2 times [2022-04-28 15:04:13,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:04:13,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896842038] [2022-04-28 15:04:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:04:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:04:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:13,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:04:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:13,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {325179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {325173#true} is VALID [2022-04-28 15:04:13,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-28 15:04:13,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-28 15:04:13,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {325173#true} call ULTIMATE.init(); {325179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:04:13,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {325179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {325173#true} is VALID [2022-04-28 15:04:13,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-28 15:04:13,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-28 15:04:13,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {325173#true} call #t~ret14 := main(); {325173#true} is VALID [2022-04-28 15:04:13,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {325173#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;havoc ~cond~0; {325173#true} is VALID [2022-04-28 15:04:13,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {325173#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {325173#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; {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {325173#true} assume !(0 != ~p1~0); {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {325173#true} assume !(0 != ~p2~0); {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {325173#true} assume !(0 != ~p3~0); {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {325173#true} assume !(0 != ~p4~0); {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {325173#true} assume !(0 != ~p5~0); {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {325173#true} assume !(0 != ~p6~0); {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {325173#true} assume !(0 != ~p7~0); {325173#true} is VALID [2022-04-28 15:04:13,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {325173#true} assume !(0 != ~p8~0); {325173#true} is VALID [2022-04-28 15:04:13,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {325173#true} assume !(0 != ~p9~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p1~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p2~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p3~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p4~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p5~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p6~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p7~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p8~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 15:04:13,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {325178#(= main_~p9~0 0)} assume 0 != ~p9~0; {325174#false} is VALID [2022-04-28 15:04:13,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {325174#false} assume 1 != ~lk9~0; {325174#false} is VALID [2022-04-28 15:04:13,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {325174#false} assume !false; {325174#false} is VALID [2022-04-28 15:04:13,981 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:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:04:13,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896842038] [2022-04-28 15:04:13,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896842038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:13,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:13,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:04:13,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:04:13,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938015028] [2022-04-28 15:04:13,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938015028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:13,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:13,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:04:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878443474] [2022-04-28 15:04:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:04:13,983 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 15:04:13,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:04:13,983 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 15:04:13,999 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 15:04:14,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:04:14,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:04:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:04:14,000 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 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 15:04:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:41,235 INFO L93 Difference]: Finished difference Result 22793 states and 25991 transitions. [2022-04-28 15:04:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:04:41,235 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 15:04:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:04:41,235 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 15:04:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 15:04:41,236 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 15:04:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 15:04:41,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 15:04:41,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:41,329 INFO L225 Difference]: With dead ends: 22793 [2022-04-28 15:04:41,329 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 15:04:41,361 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:04:41,361 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:04:41,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:04:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 15:04:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 15:04:41,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:04:41,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:04:41,362 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:04:41,362 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:04:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:41,363 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:04:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:04:41,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:04:41,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:04:41,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:04:41,363 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:04:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:41,363 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:04:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:04:41,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:04:41,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:04:41,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:04:41,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:04:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:04:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 15:04:41,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 15:04:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:04:41,364 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 15:04:41,364 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 15:04:41,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 15:04:41,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:04:41,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:04:41,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:04:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:04:41,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 15:04:51,097 WARN L232 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 573 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:04:57,504 WARN L232 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 688 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:05:48,767 WARN L232 SmtUtils]: Spent 38.07s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:06:34,658 WARN L232 SmtUtils]: Spent 37.64s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:06:57,708 WARN L232 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 1071 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:07:12,383 WARN L232 SmtUtils]: Spent 14.67s on a formula simplification that was a NOOP. DAG size: 657 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:07:40,366 WARN L232 SmtUtils]: Spent 27.98s on a formula simplification that was a NOOP. DAG size: 1329 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:07:55,930 WARN L232 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 609 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:08:09,864 WARN L232 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:08:20,360 WARN L232 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 689 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:08:38,056 WARN L232 SmtUtils]: Spent 17.69s on a formula simplification that was a NOOP. DAG size: 753 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:09:00,041 WARN L232 SmtUtils]: Spent 21.98s on a formula simplification that was a NOOP. DAG size: 945 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:09:10,020 WARN L232 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 585 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:09:15,876 WARN L232 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 298 DAG size of output: 161 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:09:26,342 WARN L232 SmtUtils]: Spent 10.45s on a formula simplification. DAG size of input: 562 DAG size of output: 159 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:09:39,348 WARN L232 SmtUtils]: Spent 12.99s on a formula simplification. DAG size of input: 682 DAG size of output: 159 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:09:52,000 WARN L232 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 582 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:09:57,940 WARN L232 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 548 DAG size of output: 15 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:10:07,033 WARN L232 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 616 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:10:13,148 WARN L232 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 554 DAG size of output: 23 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:10:21,211 WARN L232 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 543 DAG size of output: 7 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:10:27,751 WARN L232 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 564 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:10:34,487 WARN L232 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 1056 DAG size of output: 3 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:10:41,141 WARN L232 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 642 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:10:52,665 WARN L232 SmtUtils]: Spent 11.51s on a formula simplification. DAG size of input: 1314 DAG size of output: 7 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:11:08,008 WARN L232 SmtUtils]: Spent 12.77s on a formula simplification. DAG size of input: 302 DAG size of output: 296 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:11:15,053 WARN L232 SmtUtils]: Spent 7.03s on a formula simplification. DAG size of input: 594 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:11:53,685 WARN L232 SmtUtils]: Spent 36.48s on a formula simplification. DAG size of input: 558 DAG size of output: 551 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:12:11,733 WARN L232 SmtUtils]: Spent 18.02s on a formula simplification. DAG size of input: 556 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:12:28,513 WARN L232 SmtUtils]: Spent 16.76s on a formula simplification. DAG size of input: 556 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:12:38,651 WARN L232 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 738 DAG size of output: 23 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:12:46,581 WARN L232 SmtUtils]: Spent 7.92s on a formula simplification. DAG size of input: 930 DAG size of output: 15 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:12:54,832 WARN L232 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 570 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:12:54,846 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 15:12:54,847 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 15:12:54,847 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 15:12:54,847 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:12:54,847 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 15:12:54,847 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:12:54,847 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:12:54,847 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 15:12:54,847 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 15:12:54,847 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:12:54,847 INFO L895 garLoopResultBuilder]: At program point L126-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk9~0 1)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p9~0 0)) (.cse3 (= main_~p7~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse3) (and .cse0 .cse4 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse5 .cse3))) [2022-04-28 15:12:54,847 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 151) the Hoare annotation is: true [2022-04-28 15:12:54,850 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse16 (= main_~p6~0 0)) (.cse11 (= main_~p9~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse17 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse10 (= main_~lk8~0 1)) (.cse15 (= main_~p2~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse12 (= main_~p7~0 0)) (.cse13 (= main_~p5~0 0)) (.cse7 (= main_~lk9~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse14 (= main_~p3~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse16) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse15 .cse7 .cse8) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse15 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse16 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse16 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse15 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse16 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse15 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse15 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse16 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse16 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9))) [2022-04-28 15:12:54,850 INFO L895 garLoopResultBuilder]: At program point L127(line 127) the Hoare annotation is: (let ((.cse0 (= main_~lk8~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse1 (= main_~p9~0 0)) (.cse7 (= main_~p8~0 0)) (.cse2 (= main_~p7~0 0)) (.cse6 (= main_~lk9~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse3 .cse4) (and .cse5 .cse7 .cse6 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse5 .cse7 .cse1 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse2 .cse6 .cse3 .cse4))) [2022-04-28 15:12:54,850 INFO L895 garLoopResultBuilder]: At program point L111-1(lines 38 146) the Hoare annotation is: (let ((.cse8 (= main_~lk9~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse11 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p4~0 0)) (.cse10 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~p9~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse9 .cse10 .cse6 .cse8 .cse11) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse11) (and .cse9 .cse10 .cse6 .cse2 .cse7 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse10 .cse1 .cse2 .cse7 .cse5) (and .cse0 .cse9 .cse10 .cse6 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse11) (and .cse9 .cse1 .cse2 .cse7 .cse4 .cse11) (and .cse10 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse11) (and .cse10 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse1 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse4 .cse8 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse4 .cse11) (and .cse9 .cse1 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse11) (and .cse10 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse6 .cse4 .cse8 .cse5) (and .cse9 .cse6 .cse7 .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse11) (and .cse10 .cse6 .cse3 .cse7 .cse8 .cse11) (and .cse0 .cse9 .cse10 .cse6 .cse2 .cse11) (and .cse0 .cse9 .cse10 .cse6 .cse2 .cse5) (and .cse9 .cse1 .cse7 .cse4 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse11) (and .cse1 .cse3 .cse7 .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse1 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse10 .cse1 .cse3 .cse7 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse8 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse11) (and .cse9 .cse10 .cse6 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse5) (and .cse9 .cse6 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse8 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse11) (and .cse9 .cse10 .cse1 .cse2 .cse7 .cse11) (and .cse10 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse9 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse9 .cse10 .cse1 .cse8 .cse5) (and .cse10 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11) (and .cse9 .cse6 .cse2 .cse7 .cse4 .cse11) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse5))) [2022-04-28 15:12:54,850 INFO L895 garLoopResultBuilder]: At program point L136-1(lines 38 146) the Hoare annotation is: (or (= main_~p9~0 0) (= main_~lk9~0 1)) [2022-04-28 15:12:54,853 INFO L895 garLoopResultBuilder]: At program point L95-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse1 (= main_~lk8~0 1)) (.cse14 (= main_~p6~0 0)) (.cse13 (= main_~lk5~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk9~0 1)) (.cse8 (= main_~p3~0 0)) (.cse9 (= main_~lk7~0 1)) (.cse10 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse15 (= main_~p9~0 0)) (.cse17 (= main_~lk3~0 1)) (.cse12 (= main_~p1~0 0)) (.cse4 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1)) (.cse16 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse5 .cse14) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse14 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse6 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse14 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse5 .cse14 .cse8) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse5 .cse7) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse5 .cse14) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse7 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse6 .cse7 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse7 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse7 .cse16) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse5 .cse6 .cse7) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse7 .cse16) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse5 .cse7 .cse8) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse14 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse5 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse14 .cse8) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse6 .cse7 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse14 .cse8 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse5 .cse14 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse5 .cse14 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse5 .cse14) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse6 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse5 .cse14) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse5 .cse14 .cse8) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse7 .cse16) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse6 .cse14 .cse8 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse5 .cse7) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse5 .cse7) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse5 .cse14) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse7 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse5 .cse7) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse5 .cse7) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse5 .cse7 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse5 .cse14) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse5 .cse14) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse5 .cse7) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse14 .cse16) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse5 .cse7) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse5 .cse14) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse5 .cse7) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse5 .cse14) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse7 .cse8 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse5 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse14 .cse16) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse7 .cse16))) [2022-04-28 15:12:54,853 INFO L895 garLoopResultBuilder]: At program point L87-1(lines 38 146) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-28 15:12:54,854 INFO L895 garLoopResultBuilder]: At program point L112(line 112) the Hoare annotation is: (let ((.cse13 (= main_~p9~0 0)) (.cse12 (= main_~p8~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse9 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse10 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~lk9~0 1)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse10 .cse2 .cse8 .cse3 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse12 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse13 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7) (and .cse0 .cse2 .cse13 .cse8 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse10 .cse2 .cse13 .cse8 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse12 .cse13 .cse8 .cse3 .cse4 .cse7) (and .cse0 .cse10 .cse12 .cse13 .cse8 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse8 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse2 .cse13 .cse3 .cse4 .cse7) (and .cse0 .cse12 .cse13 .cse8 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse10 .cse12 .cse8 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse8 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse8 .cse3 .cse7) (and .cse0 .cse1 .cse10 .cse12 .cse13 .cse3 .cse4 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse13 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse2 .cse13 .cse8 .cse3 .cse5 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse13 .cse3 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse13 .cse3 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse13 .cse3 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse3 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse13 .cse3 .cse5 .cse7) (and .cse0 .cse9 .cse10 .cse12 .cse8 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse12 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse10 .cse2 .cse8 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse13 .cse8 .cse3 .cse11) (and .cse0 .cse2 .cse13 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse2 .cse13 .cse8 .cse3 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse12 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse13 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse2 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse12 .cse13 .cse8 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse13 .cse8 .cse3 .cse7) (and .cse0 .cse9 .cse12 .cse8 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse2 .cse8 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse12 .cse13 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse2 .cse8 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse10 .cse12 .cse8 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse9 .cse12 .cse13 .cse8 .cse3 .cse5 .cse7) (and .cse0 .cse10 .cse2 .cse13 .cse8 .cse3 .cse4 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse12 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse12 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse8 .cse3 .cse11) (and .cse0 .cse12 .cse13 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse13 .cse3 .cse7) (and .cse0 .cse12 .cse8 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse6 .cse7))) [2022-04-28 15:12:54,854 INFO L895 garLoopResultBuilder]: At program point L79-1(lines 38 146) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-28 15:12:54,854 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 151) the Hoare annotation is: true [2022-04-28 15:12:54,854 INFO L895 garLoopResultBuilder]: At program point L137(line 137) the Hoare annotation is: (let ((.cse0 (not (= main_~p8~0 0))) (.cse1 (= main_~lk8~0 1))) (or (and .cse0 .cse1 (= main_~lk9~0 1)) (and .cse0 .cse1 (= main_~p9~0 0)))) [2022-04-28 15:12:54,854 INFO L895 garLoopResultBuilder]: At program point L71-1(lines 38 146) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-28 15:12:54,854 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) the Hoare annotation is: false [2022-04-28 15:12:54,854 INFO L902 garLoopResultBuilder]: At program point L63(lines 63 65) the Hoare annotation is: true [2022-04-28 15:12:54,855 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2022-04-28 15:12:54,855 INFO L895 garLoopResultBuilder]: At program point L63-2(lines 38 146) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 15:12:54,855 INFO L895 garLoopResultBuilder]: At program point L121-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk9~0 1)) (.cse3 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse4 (= main_~p9~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse6) (and .cse1 .cse5 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse4 .cse3) (and .cse0 .cse7 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse7 .cse4 .cse5 .cse3) (and .cse0 .cse7 .cse2 .cse6) (and .cse7 .cse4 .cse5 .cse6) (and .cse7 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse4 .cse6) (and .cse7 .cse5 .cse2 .cse3) (and .cse0 .cse7 .cse4 .cse6))) [2022-04-28 15:12:54,855 INFO L895 garLoopResultBuilder]: At program point L122(line 122) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~lk8~0 1)) (.cse4 (= main_~lk9~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p9~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse2 .cse6 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9))) [2022-04-28 15:12:54,855 INFO L902 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-04-28 15:12:54,856 INFO L895 garLoopResultBuilder]: At program point L106-1(lines 38 146) the Hoare annotation is: (let ((.cse10 (= main_~p3~0 0)) (.cse12 (= main_~lk5~0 1)) (.cse7 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse5 (= main_~lk9~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~lk8~0 1)) (.cse13 (= main_~p9~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse3 (= main_~p7~0 0)) (.cse4 (= main_~p5~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse8 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse12 .cse11 .cse3 .cse5 .cse9 .cse10) (and .cse11 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse8 .cse2 .cse5 .cse6) (and .cse11 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse11 .cse4 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse3 .cse6 .cse10) (and .cse7 .cse12 .cse1 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse1 .cse5 .cse6 .cse10) (and .cse11 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse11 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse6 .cse10) (and .cse7 .cse1 .cse8 .cse2 .cse4 .cse5 .cse9) (and .cse0 .cse11 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse8 .cse2 .cse5 .cse9) (and .cse12 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse1 .cse8 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse1 .cse8 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse11 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse12 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse2 .cse5 .cse6) (and .cse12 .cse1 .cse13 .cse8 .cse3 .cse6 .cse10) (and .cse12 .cse11 .cse13 .cse8 .cse3 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse3 .cse9 .cse10) (and .cse1 .cse13 .cse8 .cse3 .cse4 .cse9 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse2 .cse9) (and .cse7 .cse12 .cse11 .cse8 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse4 .cse6 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse2 .cse9) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse6 .cse10) (and .cse7 .cse1 .cse13 .cse8 .cse2 .cse4 .cse9) (and .cse7 .cse12 .cse11 .cse8 .cse5 .cse9 .cse10) (and .cse12 .cse11 .cse8 .cse3 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10) (and .cse11 .cse13 .cse8 .cse3 .cse4 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse11 .cse13 .cse8 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse2 .cse6) (and .cse7 .cse12 .cse1 .cse8 .cse5 .cse6 .cse10) (and .cse0 .cse11 .cse13 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse2 .cse4 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse11 .cse2 .cse5 .cse9) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse9 .cse10) (and .cse7 .cse1 .cse13 .cse8 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse12 .cse11 .cse13 .cse2 .cse3 .cse9) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse12 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse6 .cse10) (and .cse11 .cse13 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse2 .cse9) (and .cse0 .cse11 .cse13 .cse3 .cse4 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse6 .cse10) (and .cse12 .cse11 .cse13 .cse8 .cse2 .cse3 .cse6) (and .cse0 .cse12 .cse11 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse1 .cse13 .cse2 .cse4 .cse6) (and .cse7 .cse12 .cse11 .cse8 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse2 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse5 .cse9 .cse10) (and .cse1 .cse13 .cse8 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse2 .cse4 .cse5 .cse9) (and .cse1 .cse13 .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse12 .cse1 .cse8 .cse2 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse11 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse7 .cse1 .cse13 .cse8 .cse2 .cse4 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse2 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse13 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse1 .cse13 .cse8 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse13 .cse4 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse9 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse2 .cse4 .cse9) (and .cse12 .cse11 .cse13 .cse8 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse7 .cse11 .cse13 .cse8 .cse2 .cse4 .cse6) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse2 .cse6) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse2 .cse9) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse3 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse11 .cse13 .cse8 .cse4 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse12 .cse1 .cse13 .cse8 .cse3 .cse9 .cse10) (and .cse7 .cse11 .cse13 .cse8 .cse2 .cse4 .cse9) (and .cse7 .cse1 .cse13 .cse8 .cse4 .cse9 .cse10) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse12 .cse1 .cse2 .cse5 .cse9) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse12 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9) (and .cse12 .cse11 .cse13 .cse8 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse11 .cse13 .cse4 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse12 .cse11 .cse8 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse3 .cse5 .cse6 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse11 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse1 .cse13 .cse8 .cse2 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse9) (and .cse12 .cse11 .cse8 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse1 .cse13 .cse8 .cse2 .cse3 .cse4 .cse9))) [2022-04-28 15:12:54,856 INFO L902 garLoopResultBuilder]: At program point L40(lines 40 42) the Hoare annotation is: true [2022-04-28 15:12:54,856 INFO L895 garLoopResultBuilder]: At program point L131-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p9~0 0)) (.cse2 (= main_~p8~0 0)) (.cse0 (= main_~lk8~0 1)) (.cse3 (= main_~lk9~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse0 .cse3))) [2022-04-28 15:12:54,857 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse8 (= main_~lk8~0 1)) (.cse14 (= main_~lk9~0 1)) (.cse10 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse12 (= main_~p5~0 0)) (.cse13 (= main_~p3~0 0)) (.cse11 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse12 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse4 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse14 .cse10 .cse7) (and .cse2 .cse4 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse2 .cse4 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse14 .cse10 .cse7) (and .cse2 .cse4 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse12 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse12 .cse6 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse14 .cse10 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse11 .cse2 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse12 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse10 .cse7) (and .cse0 .cse2 .cse4 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse12 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse11 .cse1 .cse2 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse14 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7))) [2022-04-28 15:12:54,857 INFO L895 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (let ((.cse3 (= main_~lk9~0 1)) (.cse4 (= main_~lk8~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~p9~0 0)) (.cse2 (not (= main_~p7~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2) (and .cse0 .cse1 .cse5 .cse2))) [2022-04-28 15:12:54,858 INFO L895 garLoopResultBuilder]: At program point L91-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse4 (= main_~p1~0 0)) (.cse6 (= main_~p2~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse13 (= main_~p8~0 0)) (.cse14 (= main_~lk4~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse12 (= main_~lk1~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse15 (= main_~p3~0 0)) (.cse11 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse10 .cse11) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse10 .cse15) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse7 .cse15) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse10) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse10 .cse15) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse10 .cse15 .cse11))) [2022-04-28 15:12:54,858 INFO L895 garLoopResultBuilder]: At program point L116-1(lines 38 146) the Hoare annotation is: (let ((.cse5 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse8 (= main_~lk9~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~p6~0 0)) (.cse6 (= main_~lk8~0 1)) (.cse2 (= main_~p9~0 0)) (.cse3 (= main_~p7~0 0)) (.cse7 (= main_~p5~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse2 .cse9) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse8 .cse9) (and .cse6 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse6 .cse3 .cse8 .cse4) (and .cse5 .cse1 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse5 .cse0 .cse6 .cse8 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse5 .cse1 .cse2 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse8 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse9) (and .cse5 .cse1 .cse2 .cse7 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse6 .cse2 .cse3 .cse9) (and .cse6 .cse3 .cse7 .cse8 .cse4) (and .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse3 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse3 .cse7 .cse9))) [2022-04-28 15:12:54,859 INFO L895 garLoopResultBuilder]: At program point L83-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-28 15:12:54,859 INFO L902 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-04-28 15:12:54,859 INFO L895 garLoopResultBuilder]: At program point L75-1(lines 38 146) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-28 15:12:54,859 INFO L895 garLoopResultBuilder]: At program point L67-1(lines 38 146) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-28 15:12:54,859 INFO L895 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: (let ((.cse9 (= main_~lk8~0 1)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~p7~0 0)) (.cse8 (= main_~lk9~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse4 (not (= main_~p4~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse11 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse6) (and .cse1 .cse9 .cse4 .cse5 .cse7 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse6) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse8 .cse6) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse9 .cse4 .cse5 .cse7 .cse10 .cse8 .cse11) (and .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse10 .cse8 .cse11) (and .cse2 .cse4 .cse5 .cse7 .cse10 .cse8 .cse6) (and .cse1 .cse9 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6) (and .cse9 .cse4 .cse5 .cse7 .cse10 .cse8 .cse6) (and .cse0 .cse9 .cse4 .cse5 .cse10 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse9 .cse4 .cse5 .cse10 .cse8 .cse6) (and .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse6) (and .cse2 .cse4 .cse5 .cse7 .cse10 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse8 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse10 .cse8 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11))) [2022-04-28 15:12:54,859 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (= main_~lk9~0 1) [2022-04-28 15:12:54,859 INFO L895 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-04-28 15:12:54,861 INFO L895 garLoopResultBuilder]: At program point L101-1(lines 38 146) the Hoare annotation is: (let ((.cse4 (= main_~lk4~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse9 (= main_~p7~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~lk2~0 1)) (.cse13 (= main_~p3~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse11 (= main_~p4~0 0)) (.cse8 (= main_~lk8~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse14 (= main_~p5~0 0)) (.cse12 (= main_~p2~0 0)) (.cse15 (= main_~lk9~0 1)) (.cse10 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse6 .cse13) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse4 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse15 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse12 .cse10) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse2 .cse4 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse8 .cse4 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse15 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse2 .cse4 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse15 .cse10 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse12 .cse15 .cse10) (and .cse11 .cse2 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse12 .cse10 .cse13) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse1 .cse8 .cse4 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse15 .cse6) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse10 .cse13) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse12 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse12 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse12 .cse6 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse11 .cse2 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse11 .cse8 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse12 .cse10 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse4 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse6) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse8 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse12 .cse6) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse10 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse0 .cse8 .cse4 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse15 .cse10) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse2 .cse4 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse12 .cse10) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse8 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse8 .cse4 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse2 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse12 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse12 .cse10) (and .cse2 .cse4 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse2 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse2 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse12 .cse15 .cse10))) [2022-04-28 15:12:54,863 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 15:12:54,867 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:12:54,871 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:12:54,872 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:12:55,199 INFO L163 areAnnotationChecker]: CFG has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 15:12:55,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:12:55 BoogieIcfgContainer [2022-04-28 15:12:55,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:12:55,205 INFO L158 Benchmark]: Toolchain (without parser) took 664975.10ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 127.3MB in the beginning and 652.6MB in the end (delta: -525.3MB). Peak memory consumption was 915.5MB. Max. memory is 8.0GB. [2022-04-28 15:12:55,205 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:12:55,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.63ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 152.2MB in the end (delta: -25.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:12:55,206 INFO L158 Benchmark]: Boogie Preprocessor took 36.06ms. Allocated memory is still 174.1MB. Free memory was 152.2MB in the beginning and 150.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 15:12:55,206 INFO L158 Benchmark]: RCFGBuilder took 295.53ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 137.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 15:12:55,206 INFO L158 Benchmark]: TraceAbstraction took 664346.49ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 136.4MB in the beginning and 652.6MB in the end (delta: -516.2MB). Peak memory consumption was 925.2MB. Max. memory is 8.0GB. [2022-04-28 15:12:55,207 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.63ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 152.2MB in the end (delta: -25.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.06ms. Allocated memory is still 174.1MB. Free memory was 152.2MB in the beginning and 150.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 295.53ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 137.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 664346.49ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 136.4MB in the beginning and 652.6MB in the end (delta: -516.2MB). Peak memory consumption was 925.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 663.9s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 70.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 493.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2859 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2859 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1968 mSDtfsCounter, 1367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=24, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 12851 NumberOfFragments, 51244 HoareAnnotationTreeSize, 42 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 268.6s HoareSimplificationTime, 42 FomulaSimplificationsInter, 2169939 FormulaSimplificationTreeSizeReductionInter, 224.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 15:12:55,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...